./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '6148f57821a61bb66da81c5e9fb13250aa14d609ed7f31d3b9237ae5f0b8d661'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6148f57821a61bb66da81c5e9fb13250aa14d609ed7f31d3b9237ae5f0b8d661 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:38:08,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:38:08,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:38:08,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:38:08,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:38:08,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:38:08,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:38:08,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:38:08,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:38:08,175 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:38:08,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:38:08,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:38:08,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:38:08,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:38:08,177 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:38:08,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:38:08,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:38:08,177 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:38:08,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:38:08,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:38:08,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:38:08,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:38:08,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:38:08,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:38:08,179 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:38:08,179 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:38:08,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:38:08,179 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:38:08,179 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:38:08,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:38:08,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:38:08,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:38:08,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:38:08,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:38:08,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:38:08,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:38:08,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:38:08,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:38:08,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:38:08,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:38:08,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:38:08,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:38:08,181 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6148f57821a61bb66da81c5e9fb13250aa14d609ed7f31d3b9237ae5f0b8d661 [2024-11-07 04:38:08,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:38:08,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:38:08,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:38:08,512 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:38:08,512 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:38:08,513 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i [2024-11-07 04:38:09,792 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:38:10,043 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:38:10,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i [2024-11-07 04:38:10,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e14cebbaa/c73436367b084de29267d9e63b347b4f/FLAGd3a62ab79 [2024-11-07 04:38:10,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e14cebbaa/c73436367b084de29267d9e63b347b4f [2024-11-07 04:38:10,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:38:10,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:38:10,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:38:10,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:38:10,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:38:10,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:38:10" (1/1) ... [2024-11-07 04:38:10,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d699af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:10, skipping insertion in model container [2024-11-07 04:38:10,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:38:10" (1/1) ... [2024-11-07 04:38:10,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:38:10,528 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i[913,926] [2024-11-07 04:38:10,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:38:10,617 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:38:10,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i[913,926] [2024-11-07 04:38:10,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:38:10,690 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:38:10,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:10 WrapperNode [2024-11-07 04:38:10,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:38:10,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:38:10,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:38:10,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:38:10,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:10" (1/1) ... [2024-11-07 04:38:10,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:10" (1/1) ... [2024-11-07 04:38:10,755 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-11-07 04:38:10,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:38:10,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:38:10,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:38:10,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:38:10,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:10" (1/1) ... [2024-11-07 04:38:10,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:10" (1/1) ... [2024-11-07 04:38:10,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:10" (1/1) ... [2024-11-07 04:38:10,801 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 04:38:10,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:10" (1/1) ... [2024-11-07 04:38:10,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:10" (1/1) ... [2024-11-07 04:38:10,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:10" (1/1) ... [2024-11-07 04:38:10,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:10" (1/1) ... [2024-11-07 04:38:10,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:10" (1/1) ... [2024-11-07 04:38:10,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:10" (1/1) ... [2024-11-07 04:38:10,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:38:10,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:38:10,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:38:10,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:38:10,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:10" (1/1) ... [2024-11-07 04:38:10,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:38:10,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:38:10,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 04:38:10,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 04:38:10,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:38:10,892 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:38:10,892 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:38:10,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:38:10,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:38:10,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:38:10,966 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:38:10,967 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:38:11,285 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-07 04:38:11,285 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:38:11,294 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:38:11,295 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:38:11,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:38:11 BoogieIcfgContainer [2024-11-07 04:38:11,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:38:11,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:38:11,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:38:11,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:38:11,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:38:10" (1/3) ... [2024-11-07 04:38:11,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e4cbf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:38:11, skipping insertion in model container [2024-11-07 04:38:11,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:10" (2/3) ... [2024-11-07 04:38:11,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e4cbf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:38:11, skipping insertion in model container [2024-11-07 04:38:11,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:38:11" (3/3) ... [2024-11-07 04:38:11,308 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-86.i [2024-11-07 04:38:11,324 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:38:11,324 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:38:11,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:38:11,400 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b4ce339, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:38:11,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:38:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 04:38:11,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 04:38:11,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:38:11,419 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:38:11,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:38:11,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:38:11,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1399999483, now seen corresponding path program 1 times [2024-11-07 04:38:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:38:11,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669651979] [2024-11-07 04:38:11,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:38:11,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:38:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:11,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:38:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:11,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:38:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:11,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:38:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:11,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:38:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:11,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:38:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:11,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:38:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:11,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:38:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:11,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:38:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:11,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:38:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:11,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:38:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:11,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:38:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:11,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:38:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:11,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:38:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:11,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:38:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:11,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:38:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:38:11,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:38:11,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669651979] [2024-11-07 04:38:11,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669651979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:38:11,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:38:11,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:38:11,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451843084] [2024-11-07 04:38:11,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:38:11,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:38:11,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:38:11,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:38:11,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:38:11,840 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 04:38:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:38:11,863 INFO L93 Difference]: Finished difference Result 103 states and 173 transitions. [2024-11-07 04:38:11,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:38:11,865 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2024-11-07 04:38:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:38:11,870 INFO L225 Difference]: With dead ends: 103 [2024-11-07 04:38:11,871 INFO L226 Difference]: Without dead ends: 51 [2024-11-07 04:38:11,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:38:11,879 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:38:11,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:38:11,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-07 04:38:11,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-07 04:38:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 04:38:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2024-11-07 04:38:11,924 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 101 [2024-11-07 04:38:11,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:38:11,924 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2024-11-07 04:38:11,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 04:38:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2024-11-07 04:38:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 04:38:11,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:38:11,930 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:38:11,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:38:11,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:38:11,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:38:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1736788935, now seen corresponding path program 1 times [2024-11-07 04:38:11,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:38:11,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150766522] [2024-11-07 04:38:11,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:38:11,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:38:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:12,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:38:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:12,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:38:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:12,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:38:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:12,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:38:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:12,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:38:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:12,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:38:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:12,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:38:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:12,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:38:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:12,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:38:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:12,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:38:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:12,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:38:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:12,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:38:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:12,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:38:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:12,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:38:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:12,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:38:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:38:12,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:38:12,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150766522] [2024-11-07 04:38:12,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150766522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:38:12,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:38:12,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 04:38:12,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607649066] [2024-11-07 04:38:12,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:38:12,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:38:12,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:38:12,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:38:12,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:38:12,522 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:38:12,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:38:12,724 INFO L93 Difference]: Finished difference Result 148 states and 220 transitions. [2024-11-07 04:38:12,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 04:38:12,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-07 04:38:12,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:38:12,727 INFO L225 Difference]: With dead ends: 148 [2024-11-07 04:38:12,727 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 04:38:12,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:38:12,728 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 67 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:38:12,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 240 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:38:12,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 04:38:12,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2024-11-07 04:38:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 04:38:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2024-11-07 04:38:12,756 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 101 [2024-11-07 04:38:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:38:12,756 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2024-11-07 04:38:12,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:38:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2024-11-07 04:38:12,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 04:38:12,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:38:12,761 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:38:12,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:38:12,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:38:12,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:38:12,763 INFO L85 PathProgramCache]: Analyzing trace with hash 725671685, now seen corresponding path program 1 times [2024-11-07 04:38:12,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:38:12,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190946041] [2024-11-07 04:38:12,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:38:12,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:38:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:17,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:38:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:17,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:38:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:17,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:38:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:17,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:38:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:17,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:38:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:17,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:38:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:17,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:38:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:17,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:38:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:17,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:38:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:17,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:38:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:17,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:38:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:17,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:38:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:17,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:38:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:17,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:38:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:17,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:38:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:38:17,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:38:17,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190946041] [2024-11-07 04:38:17,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190946041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:38:17,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:38:17,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 04:38:17,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183777587] [2024-11-07 04:38:17,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:38:17,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 04:38:17,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:38:17,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 04:38:17,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-07 04:38:17,469 INFO L87 Difference]: Start difference. First operand 80 states and 118 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:38:18,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:38:18,746 INFO L93 Difference]: Finished difference Result 204 states and 296 transitions. [2024-11-07 04:38:18,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 04:38:18,747 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-07 04:38:18,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:38:18,749 INFO L225 Difference]: With dead ends: 204 [2024-11-07 04:38:18,749 INFO L226 Difference]: Without dead ends: 156 [2024-11-07 04:38:18,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2024-11-07 04:38:18,751 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 217 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 04:38:18,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 497 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 04:38:18,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-07 04:38:18,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 97. [2024-11-07 04:38:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 04:38:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2024-11-07 04:38:18,774 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 101 [2024-11-07 04:38:18,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:38:18,775 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2024-11-07 04:38:18,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:38:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2024-11-07 04:38:18,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 04:38:18,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:38:18,780 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:38:18,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:38:18,780 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:38:18,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:38:18,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1426736263, now seen corresponding path program 1 times [2024-11-07 04:38:18,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:38:18,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468704317] [2024-11-07 04:38:18,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:38:18,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:38:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:18,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:38:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:18,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:38:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:18,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:38:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:18,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:38:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:18,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:38:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:18,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:38:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:18,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:38:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:18,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:38:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:18,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:38:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:18,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:38:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:18,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:38:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:18,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:38:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:18,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:38:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:18,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:38:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:18,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:38:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:38:18,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:38:18,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468704317] [2024-11-07 04:38:18,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468704317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:38:18,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:38:18,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:38:18,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69389934] [2024-11-07 04:38:18,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:38:18,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:38:18,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:38:18,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:38:18,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:38:18,877 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:38:18,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:38:18,923 INFO L93 Difference]: Finished difference Result 192 states and 283 transitions. [2024-11-07 04:38:18,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:38:18,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-07 04:38:18,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:38:18,925 INFO L225 Difference]: With dead ends: 192 [2024-11-07 04:38:18,925 INFO L226 Difference]: Without dead ends: 144 [2024-11-07 04:38:18,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:38:18,930 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 67 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:38:18,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 150 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:38:18,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-07 04:38:18,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2024-11-07 04:38:18,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 93 states have internal predecessors, (117), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 04:38:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 207 transitions. [2024-11-07 04:38:18,962 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 207 transitions. Word has length 101 [2024-11-07 04:38:18,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:38:18,963 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 207 transitions. [2024-11-07 04:38:18,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:38:18,963 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 207 transitions. [2024-11-07 04:38:18,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 04:38:18,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:38:18,966 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:38:18,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 04:38:18,967 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:38:18,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:38:18,967 INFO L85 PathProgramCache]: Analyzing trace with hash 862330139, now seen corresponding path program 1 times [2024-11-07 04:38:18,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:38:18,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616787727] [2024-11-07 04:38:18,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:38:18,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:38:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:19,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:38:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:19,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:38:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:19,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:38:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:19,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:38:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:19,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:38:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:19,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:38:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:19,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:38:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:19,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:38:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:19,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:38:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:19,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:38:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:19,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:38:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:19,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:38:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:19,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:38:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:19,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:38:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:19,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:38:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:38:19,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:38:19,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616787727] [2024-11-07 04:38:19,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616787727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:38:19,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:38:19,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:38:19,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855013023] [2024-11-07 04:38:19,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:38:19,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:38:19,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:38:19,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:38:19,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:38:19,250 INFO L87 Difference]: Start difference. First operand 142 states and 207 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:38:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:38:19,304 INFO L93 Difference]: Finished difference Result 247 states and 361 transitions. [2024-11-07 04:38:19,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:38:19,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-07 04:38:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:38:19,309 INFO L225 Difference]: With dead ends: 247 [2024-11-07 04:38:19,309 INFO L226 Difference]: Without dead ends: 151 [2024-11-07 04:38:19,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:38:19,310 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:38:19,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 196 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:38:19,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-07 04:38:19,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 142. [2024-11-07 04:38:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 93 states have internal predecessors, (114), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 04:38:19,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 204 transitions. [2024-11-07 04:38:19,331 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 204 transitions. Word has length 102 [2024-11-07 04:38:19,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:38:19,332 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 204 transitions. [2024-11-07 04:38:19,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:38:19,332 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 204 transitions. [2024-11-07 04:38:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 04:38:19,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:38:19,333 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:38:19,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 04:38:19,334 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:38:19,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:38:19,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1657629795, now seen corresponding path program 1 times [2024-11-07 04:38:19,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:38:19,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077717113] [2024-11-07 04:38:19,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:38:19,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:38:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:25,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:38:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:25,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:38:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:25,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:38:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:25,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:38:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:25,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:38:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:25,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:38:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:25,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:38:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:25,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:38:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:25,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:38:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:25,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:38:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:25,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:38:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:25,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:38:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:25,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:38:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:25,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:38:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:25,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:38:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:38:25,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:38:25,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077717113] [2024-11-07 04:38:25,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077717113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:38:25,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:38:25,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 04:38:25,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086660087] [2024-11-07 04:38:25,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:38:25,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 04:38:25,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:38:25,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 04:38:25,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-07 04:38:25,376 INFO L87 Difference]: Start difference. First operand 142 states and 204 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:38:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:38:29,244 INFO L93 Difference]: Finished difference Result 197 states and 265 transitions. [2024-11-07 04:38:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 04:38:29,245 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-07 04:38:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:38:29,248 INFO L225 Difference]: With dead ends: 197 [2024-11-07 04:38:29,249 INFO L226 Difference]: Without dead ends: 195 [2024-11-07 04:38:29,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=250, Invalid=742, Unknown=0, NotChecked=0, Total=992 [2024-11-07 04:38:29,250 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 215 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 04:38:29,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 489 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 04:38:29,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-07 04:38:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 140. [2024-11-07 04:38:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 91 states have internal predecessors, (111), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 04:38:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 201 transitions. [2024-11-07 04:38:29,274 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 201 transitions. Word has length 102 [2024-11-07 04:38:29,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:38:29,274 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 201 transitions. [2024-11-07 04:38:29,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:38:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 201 transitions. [2024-11-07 04:38:29,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 04:38:29,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:38:29,276 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:38:29,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 04:38:29,276 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:38:29,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:38:29,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1074487553, now seen corresponding path program 1 times [2024-11-07 04:38:29,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:38:29,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740700060] [2024-11-07 04:38:29,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:38:29,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:38:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:31,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:38:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:31,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:38:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:31,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:38:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:31,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:38:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:31,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:38:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:31,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:38:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:31,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:38:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:31,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:38:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:31,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:38:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:31,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:38:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:31,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:38:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:31,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:38:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:31,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:38:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:31,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:38:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:31,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:38:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:38:31,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:38:31,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740700060] [2024-11-07 04:38:31,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740700060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:38:31,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:38:31,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 04:38:31,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821912907] [2024-11-07 04:38:31,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:38:31,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 04:38:31,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:38:31,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 04:38:31,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-07 04:38:31,925 INFO L87 Difference]: Start difference. First operand 140 states and 201 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:38:32,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:38:32,889 INFO L93 Difference]: Finished difference Result 195 states and 263 transitions. [2024-11-07 04:38:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 04:38:32,890 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-07 04:38:32,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:38:32,892 INFO L225 Difference]: With dead ends: 195 [2024-11-07 04:38:32,892 INFO L226 Difference]: Without dead ends: 193 [2024-11-07 04:38:32,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2024-11-07 04:38:32,893 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 268 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 04:38:32,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 428 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 04:38:32,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-07 04:38:32,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 143. [2024-11-07 04:38:32,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 94 states have internal predecessors, (115), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 04:38:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 205 transitions. [2024-11-07 04:38:32,922 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 205 transitions. Word has length 102 [2024-11-07 04:38:32,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:38:32,922 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 205 transitions. [2024-11-07 04:38:32,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:38:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 205 transitions. [2024-11-07 04:38:32,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 04:38:32,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:38:32,924 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:38:32,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 04:38:32,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:38:32,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:38:32,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2101752518, now seen corresponding path program 1 times [2024-11-07 04:38:32,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:38:32,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551205996] [2024-11-07 04:38:32,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:38:32,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:38:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:39,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:38:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:39,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:38:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:39,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:38:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:39,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:38:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:39,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:38:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:39,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:38:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:39,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:38:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:39,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:38:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:39,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:38:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:39,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:38:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:39,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:38:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:39,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:38:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:39,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:38:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:39,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:38:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:39,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:38:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:38:39,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:38:39,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551205996] [2024-11-07 04:38:39,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551205996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:38:39,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:38:39,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 04:38:39,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945263361] [2024-11-07 04:38:39,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:38:39,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 04:38:39,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:38:39,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 04:38:39,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-11-07 04:38:39,196 INFO L87 Difference]: Start difference. First operand 143 states and 205 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:38:44,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:38:44,628 INFO L93 Difference]: Finished difference Result 211 states and 283 transitions. [2024-11-07 04:38:44,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 04:38:44,628 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-07 04:38:44,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:38:44,630 INFO L225 Difference]: With dead ends: 211 [2024-11-07 04:38:44,630 INFO L226 Difference]: Without dead ends: 209 [2024-11-07 04:38:44,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2024-11-07 04:38:44,631 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 220 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 04:38:44,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 417 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 04:38:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-07 04:38:44,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 153. [2024-11-07 04:38:44,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 104 states have internal predecessors, (128), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 04:38:44,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2024-11-07 04:38:44,653 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 102 [2024-11-07 04:38:44,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:38:44,654 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2024-11-07 04:38:44,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:38:44,654 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2024-11-07 04:38:44,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 04:38:44,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:38:44,655 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:38:44,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 04:38:44,655 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:38:44,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:38:44,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1421694148, now seen corresponding path program 1 times [2024-11-07 04:38:44,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:38:44,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349912164] [2024-11-07 04:38:44,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:38:44,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:38:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:49,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:38:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:49,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:38:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:49,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:38:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:49,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:38:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:49,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:38:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:49,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:38:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:49,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:38:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:49,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:38:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:49,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:38:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:49,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:38:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:49,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:38:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:49,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:38:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:49,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:38:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:49,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:38:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:49,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:38:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:38:49,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:38:49,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349912164] [2024-11-07 04:38:49,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349912164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:38:49,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:38:49,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 04:38:49,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280276289] [2024-11-07 04:38:49,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:38:49,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 04:38:49,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:38:49,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 04:38:49,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-11-07 04:38:49,911 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:38:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:38:55,140 INFO L93 Difference]: Finished difference Result 207 states and 278 transitions. [2024-11-07 04:38:55,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 04:38:55,141 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-07 04:38:55,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:38:55,142 INFO L225 Difference]: With dead ends: 207 [2024-11-07 04:38:55,142 INFO L226 Difference]: Without dead ends: 205 [2024-11-07 04:38:55,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2024-11-07 04:38:55,143 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 214 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:38:55,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 450 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 04:38:55,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-07 04:38:55,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 153. [2024-11-07 04:38:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 104 states have internal predecessors, (128), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 04:38:55,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2024-11-07 04:38:55,159 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 102 [2024-11-07 04:38:55,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:38:55,159 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2024-11-07 04:38:55,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:38:55,160 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2024-11-07 04:38:55,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 04:38:55,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:38:55,161 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:38:55,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 04:38:55,161 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:38:55,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:38:55,161 INFO L85 PathProgramCache]: Analyzing trace with hash 206585705, now seen corresponding path program 1 times [2024-11-07 04:38:55,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:38:55,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153743883] [2024-11-07 04:38:55,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:38:55,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:38:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:59,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:38:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:59,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:38:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:59,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:38:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:59,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:38:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:59,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:38:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:59,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:38:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:59,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:38:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:59,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:38:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:59,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:38:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:59,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:38:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:59,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:38:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:59,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:38:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:59,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:38:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:59,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:38:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:59,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:38:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:38:59,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:38:59,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153743883] [2024-11-07 04:38:59,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153743883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:38:59,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:38:59,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 04:38:59,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787068050] [2024-11-07 04:38:59,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:38:59,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 04:38:59,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:38:59,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 04:38:59,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-07 04:38:59,438 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:39:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:39:01,605 INFO L93 Difference]: Finished difference Result 195 states and 264 transitions. [2024-11-07 04:39:01,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 04:39:01,607 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-11-07 04:39:01,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:39:01,609 INFO L225 Difference]: With dead ends: 195 [2024-11-07 04:39:01,609 INFO L226 Difference]: Without dead ends: 193 [2024-11-07 04:39:01,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=228, Invalid=642, Unknown=0, NotChecked=0, Total=870 [2024-11-07 04:39:01,610 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 238 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:39:01,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 404 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 04:39:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-07 04:39:01,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 150. [2024-11-07 04:39:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 101 states have (on average 1.2277227722772277) internal successors, (124), 101 states have internal predecessors, (124), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 04:39:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 214 transitions. [2024-11-07 04:39:01,621 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 214 transitions. Word has length 103 [2024-11-07 04:39:01,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:39:01,622 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 214 transitions. [2024-11-07 04:39:01,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:39:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 214 transitions. [2024-11-07 04:39:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 04:39:01,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:39:01,623 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:39:01,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 04:39:01,624 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:39:01,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:39:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash 886533128, now seen corresponding path program 1 times [2024-11-07 04:39:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:39:01,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213572769] [2024-11-07 04:39:01,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:39:01,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:39:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:06,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:39:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:06,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:39:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:06,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:39:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:06,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:39:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:06,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:39:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:06,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:39:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:06,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:39:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:06,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:39:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:39:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:06,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:39:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:06,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:39:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:06,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:39:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:06,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:39:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:06,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:39:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:06,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:39:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:06,995 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:39:06,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:39:06,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213572769] [2024-11-07 04:39:06,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213572769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:39:06,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:39:06,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-07 04:39:06,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475362378] [2024-11-07 04:39:06,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:39:06,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 04:39:06,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:39:06,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 04:39:06,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-11-07 04:39:06,997 INFO L87 Difference]: Start difference. First operand 150 states and 214 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 04:39:11,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:39:11,199 INFO L93 Difference]: Finished difference Result 213 states and 284 transitions. [2024-11-07 04:39:11,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 04:39:11,200 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 103 [2024-11-07 04:39:11,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:39:11,201 INFO L225 Difference]: With dead ends: 213 [2024-11-07 04:39:11,201 INFO L226 Difference]: Without dead ends: 211 [2024-11-07 04:39:11,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=336, Invalid=854, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 04:39:11,203 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 369 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:39:11,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 418 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 04:39:11,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-07 04:39:11,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 153. [2024-11-07 04:39:11,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 104 states have internal predecessors, (128), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 04:39:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2024-11-07 04:39:11,217 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 103 [2024-11-07 04:39:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:39:11,219 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2024-11-07 04:39:11,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 04:39:11,220 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2024-11-07 04:39:11,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 04:39:11,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:39:11,221 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:39:11,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 04:39:11,221 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:39:11,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:39:11,221 INFO L85 PathProgramCache]: Analyzing trace with hash -674469778, now seen corresponding path program 1 times [2024-11-07 04:39:11,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:39:11,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52433304] [2024-11-07 04:39:11,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:39:11,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:39:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:16,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:39:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:16,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:39:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:16,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:39:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:16,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:39:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:16,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:39:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:16,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:39:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:16,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:39:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:16,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:39:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:16,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:39:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:16,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:39:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:16,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:39:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:16,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:39:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:16,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:39:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:16,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:39:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:16,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:39:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:16,753 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:39:16,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:39:16,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52433304] [2024-11-07 04:39:16,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52433304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:39:16,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:39:16,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-07 04:39:16,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146119735] [2024-11-07 04:39:16,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:39:16,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 04:39:16,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:39:16,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 04:39:16,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2024-11-07 04:39:16,755 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 04:39:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:39:23,435 INFO L93 Difference]: Finished difference Result 211 states and 282 transitions. [2024-11-07 04:39:23,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 04:39:23,436 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 103 [2024-11-07 04:39:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:39:23,438 INFO L225 Difference]: With dead ends: 211 [2024-11-07 04:39:23,438 INFO L226 Difference]: Without dead ends: 209 [2024-11-07 04:39:23,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2024-11-07 04:39:23,439 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 309 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:39:23,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 443 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 04:39:23,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-07 04:39:23,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 156. [2024-11-07 04:39:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 107 states have (on average 1.233644859813084) internal successors, (132), 107 states have internal predecessors, (132), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 04:39:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 222 transitions. [2024-11-07 04:39:23,452 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 222 transitions. Word has length 103 [2024-11-07 04:39:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:39:23,452 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 222 transitions. [2024-11-07 04:39:23,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 04:39:23,453 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 222 transitions. [2024-11-07 04:39:23,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 04:39:23,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:39:23,454 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:39:23,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 04:39:23,454 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:39:23,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:39:23,455 INFO L85 PathProgramCache]: Analyzing trace with hash 493506118, now seen corresponding path program 1 times [2024-11-07 04:39:23,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:39:23,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836331812] [2024-11-07 04:39:23,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:39:23,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:39:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:27,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:39:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:27,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:39:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:27,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:39:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:27,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:39:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:27,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:39:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:27,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:39:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:27,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:39:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:27,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:39:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:27,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:39:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:39:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:27,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:39:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:27,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:39:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:27,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:39:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:27,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:39:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:27,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:39:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:27,590 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:39:27,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:39:27,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836331812] [2024-11-07 04:39:27,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836331812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:39:27,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:39:27,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-07 04:39:27,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141080349] [2024-11-07 04:39:27,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:39:27,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 04:39:27,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:39:27,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 04:39:27,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-07 04:39:27,593 INFO L87 Difference]: Start difference. First operand 156 states and 222 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)