./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label03.c --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/eca-rers2012/Problem19_label03.c', '-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', '26e05216e875976d2a927f5405c2e5bc5a3ea5afc4bbe64c3ca3f67a96ae3961'] 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/eca-rers2012/Problem19_label03.c -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 26e05216e875976d2a927f5405c2e5bc5a3ea5afc4bbe64c3ca3f67a96ae3961 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 20:15:41,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 20:15:41,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 20:15:41,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 20:15:41,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 20:15:41,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 20:15:41,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 20:15:41,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 20:15:41,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 20:15:41,279 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 20:15:41,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 20:15:41,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 20:15:41,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 20:15:41,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 20:15:41,279 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 20:15:41,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 20:15:41,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 20:15:41,280 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 20:15:41,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 20:15:41,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 20:15:41,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 20:15:41,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 20:15:41,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 20:15:41,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 20:15:41,283 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 20:15:41,283 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 20:15:41,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 20:15:41,283 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 20:15:41,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 20:15:41,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 20:15:41,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 20:15:41,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 20:15:41,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:15:41,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 20:15:41,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 20:15:41,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 20:15:41,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 20:15:41,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 20:15:41,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 20:15:41,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 20:15:41,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 20:15:41,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 20:15:41,286 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 -> 26e05216e875976d2a927f5405c2e5bc5a3ea5afc4bbe64c3ca3f67a96ae3961 [2024-11-06 20:15:41,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 20:15:41,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 20:15:41,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 20:15:41,598 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 20:15:41,598 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 20:15:41,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label03.c [2024-11-06 20:15:42,898 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 20:15:43,549 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 20:15:43,551 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label03.c [2024-11-06 20:15:43,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/961091467/875a5c1a4a574ce89f06dbcfd629edeb/FLAG4b760bc4d [2024-11-06 20:15:43,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/961091467/875a5c1a4a574ce89f06dbcfd629edeb [2024-11-06 20:15:43,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 20:15:43,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 20:15:43,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 20:15:43,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 20:15:43,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 20:15:43,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:15:43" (1/1) ... [2024-11-06 20:15:43,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6830fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:43, skipping insertion in model container [2024-11-06 20:15:43,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:15:43" (1/1) ... [2024-11-06 20:15:43,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 20:15:44,030 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/eca-rers2012/Problem19_label03.c[7444,7457] [2024-11-06 20:15:44,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:15:44,938 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 20:15:44,958 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/eca-rers2012/Problem19_label03.c[7444,7457] [2024-11-06 20:15:45,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:15:45,555 INFO L204 MainTranslator]: Completed translation [2024-11-06 20:15:45,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:45 WrapperNode [2024-11-06 20:15:45,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 20:15:45,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 20:15:45,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 20:15:45,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 20:15:45,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:45" (1/1) ... [2024-11-06 20:15:45,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:45" (1/1) ... [2024-11-06 20:15:46,526 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9431 [2024-11-06 20:15:46,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 20:15:46,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 20:15:46,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 20:15:46,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 20:15:46,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:45" (1/1) ... [2024-11-06 20:15:46,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:45" (1/1) ... [2024-11-06 20:15:46,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:45" (1/1) ... [2024-11-06 20:15:47,095 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-06 20:15:47,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:45" (1/1) ... [2024-11-06 20:15:47,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:45" (1/1) ... [2024-11-06 20:15:47,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:45" (1/1) ... [2024-11-06 20:15:47,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:45" (1/1) ... [2024-11-06 20:15:47,442 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:45" (1/1) ... [2024-11-06 20:15:47,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:45" (1/1) ... [2024-11-06 20:15:47,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 20:15:47,573 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 20:15:47,573 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 20:15:47,573 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 20:15:47,574 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:45" (1/1) ... [2024-11-06 20:15:47,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:15:47,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:15:47,603 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-06 20:15:47,607 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-06 20:15:47,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 20:15:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 20:15:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 20:15:47,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 20:15:47,702 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 20:15:47,704 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 20:15:55,730 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2024-11-06 20:15:55,731 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 20:15:55,773 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 20:15:55,773 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 20:15:55,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:15:55 BoogieIcfgContainer [2024-11-06 20:15:55,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 20:15:55,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 20:15:55,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 20:15:55,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 20:15:55,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:15:43" (1/3) ... [2024-11-06 20:15:55,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63bad687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:15:55, skipping insertion in model container [2024-11-06 20:15:55,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:15:45" (2/3) ... [2024-11-06 20:15:55,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63bad687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:15:55, skipping insertion in model container [2024-11-06 20:15:55,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:15:55" (3/3) ... [2024-11-06 20:15:55,784 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem19_label03.c [2024-11-06 20:15:55,799 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 20:15:55,799 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 20:15:55,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 20:15:55,915 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;@9bdde97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 20:15:55,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 20:15:55,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8699885452462772) internal successors, (3265), 1747 states have internal predecessors, (3265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:15:55,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-06 20:15:55,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:55,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:15:55,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:55,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:55,947 INFO L85 PathProgramCache]: Analyzing trace with hash -66916295, now seen corresponding path program 1 times [2024-11-06 20:15:55,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:55,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051918885] [2024-11-06 20:15:55,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:55,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:56,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:15:56,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:56,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051918885] [2024-11-06 20:15:56,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051918885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:56,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:56,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:56,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593060600] [2024-11-06 20:15:56,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:56,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:15:56,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:56,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:15:56,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:15:56,554 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8699885452462772) internal successors, (3265), 1747 states have internal predecessors, (3265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:07,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:16:07,605 INFO L93 Difference]: Finished difference Result 6284 states and 12039 transitions. [2024-11-06 20:16:07,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:16:07,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-06 20:16:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:16:07,637 INFO L225 Difference]: With dead ends: 6284 [2024-11-06 20:16:07,638 INFO L226 Difference]: Without dead ends: 4467 [2024-11-06 20:16:07,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:16:07,652 INFO L432 NwaCegarLoop]: 1812 mSDtfsCounter, 4227 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 10828 mSolverCounterSat, 2355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4227 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 13183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2355 IncrementalHoareTripleChecker+Valid, 10828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:16:07,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4227 Valid, 2090 Invalid, 13183 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2355 Valid, 10828 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2024-11-06 20:16:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4467 states. [2024-11-06 20:16:07,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4467 to 4465. [2024-11-06 20:16:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4465 states, 4464 states have (on average 1.564516129032258) internal successors, (6984), 4464 states have internal predecessors, (6984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4465 states to 4465 states and 6984 transitions. [2024-11-06 20:16:07,817 INFO L78 Accepts]: Start accepts. Automaton has 4465 states and 6984 transitions. Word has length 57 [2024-11-06 20:16:07,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:16:07,817 INFO L471 AbstractCegarLoop]: Abstraction has 4465 states and 6984 transitions. [2024-11-06 20:16:07,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand 4465 states and 6984 transitions. [2024-11-06 20:16:07,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-06 20:16:07,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:16:07,823 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:16:07,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 20:16:07,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:16:07,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:16:07,824 INFO L85 PathProgramCache]: Analyzing trace with hash -379289893, now seen corresponding path program 1 times [2024-11-06 20:16:07,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:16:07,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499862390] [2024-11-06 20:16:07,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:16:07,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:16:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:16:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:16:08,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:16:08,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499862390] [2024-11-06 20:16:08,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499862390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:16:08,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:16:08,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:16:08,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330032949] [2024-11-06 20:16:08,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:16:08,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:16:08,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:16:08,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:16:08,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:16:08,887 INFO L87 Difference]: Start difference. First operand 4465 states and 6984 transitions. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:16:17,593 INFO L93 Difference]: Finished difference Result 11708 states and 20176 transitions. [2024-11-06 20:16:17,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:16:17,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2024-11-06 20:16:17,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:16:17,628 INFO L225 Difference]: With dead ends: 11708 [2024-11-06 20:16:17,628 INFO L226 Difference]: Without dead ends: 8610 [2024-11-06 20:16:17,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:16:17,637 INFO L432 NwaCegarLoop]: 1804 mSDtfsCounter, 3758 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 9457 mSolverCounterSat, 1336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3758 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 10793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1336 IncrementalHoareTripleChecker+Valid, 9457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:16:17,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3758 Valid, 2159 Invalid, 10793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1336 Valid, 9457 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-11-06 20:16:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8610 states. [2024-11-06 20:16:17,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8610 to 8594. [2024-11-06 20:16:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8594 states, 8593 states have (on average 1.3481903875247294) internal successors, (11585), 8593 states have internal predecessors, (11585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8594 states to 8594 states and 11585 transitions. [2024-11-06 20:16:17,819 INFO L78 Accepts]: Start accepts. Automaton has 8594 states and 11585 transitions. Word has length 264 [2024-11-06 20:16:17,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:16:17,820 INFO L471 AbstractCegarLoop]: Abstraction has 8594 states and 11585 transitions. [2024-11-06 20:16:17,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 8594 states and 11585 transitions. [2024-11-06 20:16:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-06 20:16:17,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:16:17,824 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:16:17,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 20:16:17,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:16:17,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:16:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1757372353, now seen corresponding path program 1 times [2024-11-06 20:16:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:16:17,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521835108] [2024-11-06 20:16:17,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:16:17,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:16:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:16:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:16:18,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:16:18,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521835108] [2024-11-06 20:16:18,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521835108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:16:18,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:16:18,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:16:18,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209096023] [2024-11-06 20:16:18,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:16:18,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:16:18,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:16:18,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:16:18,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:16:18,439 INFO L87 Difference]: Start difference. First operand 8594 states and 11585 transitions. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:16:23,979 INFO L93 Difference]: Finished difference Result 14487 states and 20451 transitions. [2024-11-06 20:16:23,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:16:23,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 292 [2024-11-06 20:16:23,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:16:24,001 INFO L225 Difference]: With dead ends: 14487 [2024-11-06 20:16:24,001 INFO L226 Difference]: Without dead ends: 8594 [2024-11-06 20:16:24,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-06 20:16:24,014 INFO L432 NwaCegarLoop]: 1775 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7325 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 7333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:16:24,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2117 Invalid, 7333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7325 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-06 20:16:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8594 states. [2024-11-06 20:16:24,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8594 to 8594. [2024-11-06 20:16:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8594 states, 8593 states have (on average 1.3466775282206447) internal successors, (11572), 8593 states have internal predecessors, (11572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:24,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8594 states to 8594 states and 11572 transitions. [2024-11-06 20:16:24,170 INFO L78 Accepts]: Start accepts. Automaton has 8594 states and 11572 transitions. Word has length 292 [2024-11-06 20:16:24,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:16:24,171 INFO L471 AbstractCegarLoop]: Abstraction has 8594 states and 11572 transitions. [2024-11-06 20:16:24,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:24,171 INFO L276 IsEmpty]: Start isEmpty. Operand 8594 states and 11572 transitions. [2024-11-06 20:16:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2024-11-06 20:16:24,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:16:24,183 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:16:24,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 20:16:24,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:16:24,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:16:24,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1871432933, now seen corresponding path program 1 times [2024-11-06 20:16:24,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:16:24,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292581302] [2024-11-06 20:16:24,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:16:24,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:16:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:16:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-06 20:16:24,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:16:24,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292581302] [2024-11-06 20:16:24,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292581302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:16:24,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:16:24,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:16:24,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769884091] [2024-11-06 20:16:24,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:16:24,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:16:24,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:16:24,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:16:24,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:16:24,731 INFO L87 Difference]: Start difference. First operand 8594 states and 11572 transitions. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 2 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:16:29,924 INFO L93 Difference]: Finished difference Result 20123 states and 28984 transitions. [2024-11-06 20:16:29,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:16:29,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 2 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 613 [2024-11-06 20:16:29,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:16:29,960 INFO L225 Difference]: With dead ends: 20123 [2024-11-06 20:16:29,960 INFO L226 Difference]: Without dead ends: 14261 [2024-11-06 20:16:29,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 20:16:29,967 INFO L432 NwaCegarLoop]: 1338 mSDtfsCounter, 1356 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 4196 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 5626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:16:29,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 1610 Invalid, 5626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4196 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-06 20:16:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14261 states. [2024-11-06 20:16:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14261 to 14244. [2024-11-06 20:16:30,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14244 states, 14243 states have (on average 1.2723443094853613) internal successors, (18122), 14243 states have internal predecessors, (18122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14244 states to 14244 states and 18122 transitions. [2024-11-06 20:16:30,185 INFO L78 Accepts]: Start accepts. Automaton has 14244 states and 18122 transitions. Word has length 613 [2024-11-06 20:16:30,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:16:30,186 INFO L471 AbstractCegarLoop]: Abstraction has 14244 states and 18122 transitions. [2024-11-06 20:16:30,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 2 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:30,188 INFO L276 IsEmpty]: Start isEmpty. Operand 14244 states and 18122 transitions. [2024-11-06 20:16:30,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2024-11-06 20:16:30,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:16:30,203 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:16:30,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 20:16:30,204 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:16:30,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:16:30,204 INFO L85 PathProgramCache]: Analyzing trace with hash 994450106, now seen corresponding path program 1 times [2024-11-06 20:16:30,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:16:30,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711720498] [2024-11-06 20:16:30,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:16:30,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:16:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:16:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-06 20:16:30,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:16:30,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711720498] [2024-11-06 20:16:30,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711720498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:16:30,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:16:30,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:16:30,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905884614] [2024-11-06 20:16:30,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:16:30,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:16:30,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:16:30,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:16:30,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:16:30,711 INFO L87 Difference]: Start difference. First operand 14244 states and 18122 transitions. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 2 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:35,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:16:35,866 INFO L93 Difference]: Finished difference Result 28511 states and 37633 transitions. [2024-11-06 20:16:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:16:35,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 2 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 618 [2024-11-06 20:16:35,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:16:35,902 INFO L225 Difference]: With dead ends: 28511 [2024-11-06 20:16:35,902 INFO L226 Difference]: Without dead ends: 16999 [2024-11-06 20:16:35,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 20:16:35,916 INFO L432 NwaCegarLoop]: 706 mSDtfsCounter, 1387 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 3927 mSolverCounterSat, 2123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 6050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2123 IncrementalHoareTripleChecker+Valid, 3927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:16:35,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 757 Invalid, 6050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2123 Valid, 3927 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-06 20:16:35,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16999 states. [2024-11-06 20:16:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16999 to 16985. [2024-11-06 20:16:36,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16985 states, 16984 states have (on average 1.270843146490815) internal successors, (21584), 16984 states have internal predecessors, (21584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16985 states to 16985 states and 21584 transitions. [2024-11-06 20:16:36,138 INFO L78 Accepts]: Start accepts. Automaton has 16985 states and 21584 transitions. Word has length 618 [2024-11-06 20:16:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:16:36,139 INFO L471 AbstractCegarLoop]: Abstraction has 16985 states and 21584 transitions. [2024-11-06 20:16:36,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 2 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:36,140 INFO L276 IsEmpty]: Start isEmpty. Operand 16985 states and 21584 transitions. [2024-11-06 20:16:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2024-11-06 20:16:36,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:16:36,153 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:16:36,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 20:16:36,153 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:16:36,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:16:36,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1413429679, now seen corresponding path program 1 times [2024-11-06 20:16:36,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:16:36,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891116874] [2024-11-06 20:16:36,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:16:36,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:16:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:16:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-06 20:16:36,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:16:36,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891116874] [2024-11-06 20:16:36,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891116874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:16:36,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:16:36,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:16:36,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487351831] [2024-11-06 20:16:36,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:16:36,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:16:36,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:16:36,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:16:36,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:16:36,591 INFO L87 Difference]: Start difference. First operand 16985 states and 21584 transitions. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 2 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:16:41,923 INFO L93 Difference]: Finished difference Result 43710 states and 57270 transitions. [2024-11-06 20:16:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:16:41,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 2 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 621 [2024-11-06 20:16:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:16:41,989 INFO L225 Difference]: With dead ends: 43710 [2024-11-06 20:16:41,989 INFO L226 Difference]: Without dead ends: 29457 [2024-11-06 20:16:42,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 20:16:42,010 INFO L432 NwaCegarLoop]: 715 mSDtfsCounter, 2112 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5114 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2112 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 5548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:16:42,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2112 Valid, 985 Invalid, 5548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5114 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-06 20:16:42,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29457 states. [2024-11-06 20:16:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29457 to 29454. [2024-11-06 20:16:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29454 states, 29453 states have (on average 1.2556955148881268) internal successors, (36984), 29453 states have internal predecessors, (36984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29454 states to 29454 states and 36984 transitions. [2024-11-06 20:16:42,480 INFO L78 Accepts]: Start accepts. Automaton has 29454 states and 36984 transitions. Word has length 621 [2024-11-06 20:16:42,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:16:42,481 INFO L471 AbstractCegarLoop]: Abstraction has 29454 states and 36984 transitions. [2024-11-06 20:16:42,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 2 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 29454 states and 36984 transitions. [2024-11-06 20:16:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2024-11-06 20:16:42,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:16:42,487 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:16:42,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 20:16:42,487 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:16:42,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:16:42,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1919449267, now seen corresponding path program 1 times [2024-11-06 20:16:42,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:16:42,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257157161] [2024-11-06 20:16:42,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:16:42,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:16:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:16:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:16:43,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:16:43,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257157161] [2024-11-06 20:16:43,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257157161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:16:43,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:16:43,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:16:43,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893437943] [2024-11-06 20:16:43,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:16:43,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 20:16:43,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:16:43,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 20:16:43,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:16:43,420 INFO L87 Difference]: Start difference. First operand 29454 states and 36984 transitions. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:50,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:16:50,930 INFO L93 Difference]: Finished difference Result 63037 states and 78529 transitions. [2024-11-06 20:16:50,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 20:16:50,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 648 [2024-11-06 20:16:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:16:50,978 INFO L225 Difference]: With dead ends: 63037 [2024-11-06 20:16:50,978 INFO L226 Difference]: Without dead ends: 36289 [2024-11-06 20:16:51,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:16:51,007 INFO L432 NwaCegarLoop]: 1654 mSDtfsCounter, 2271 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 11539 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2271 SdHoareTripleChecker+Valid, 2027 SdHoareTripleChecker+Invalid, 11727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 11539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:16:51,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2271 Valid, 2027 Invalid, 11727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 11539 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-06 20:16:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36289 states. [2024-11-06 20:16:51,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36289 to 34921. [2024-11-06 20:16:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34921 states, 34920 states have (on average 1.2224513172966782) internal successors, (42688), 34920 states have internal predecessors, (42688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34921 states to 34921 states and 42688 transitions. [2024-11-06 20:16:51,398 INFO L78 Accepts]: Start accepts. Automaton has 34921 states and 42688 transitions. Word has length 648 [2024-11-06 20:16:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:16:51,399 INFO L471 AbstractCegarLoop]: Abstraction has 34921 states and 42688 transitions. [2024-11-06 20:16:51,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 34921 states and 42688 transitions. [2024-11-06 20:16:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2024-11-06 20:16:51,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:16:51,407 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:16:51,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 20:16:51,407 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:16:51,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:16:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash 888379329, now seen corresponding path program 1 times [2024-11-06 20:16:51,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:16:51,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909047523] [2024-11-06 20:16:51,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:16:51,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:16:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:16:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 113 proven. 51 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-11-06 20:16:52,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:16:52,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909047523] [2024-11-06 20:16:52,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909047523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:16:52,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789596159] [2024-11-06 20:16:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:16:52,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:16:52,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:16:52,366 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 20:16:52,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 20:16:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:16:52,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 20:16:52,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:16:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-11-06 20:16:52,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 20:16:52,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789596159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:16:52,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 20:16:52,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-06 20:16:52,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45385305] [2024-11-06 20:16:52,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:16:52,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:16:52,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:16:52,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:16:52,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:16:52,812 INFO L87 Difference]: Start difference. First operand 34921 states and 42688 transitions. Second operand has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:58,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:16:58,172 INFO L93 Difference]: Finished difference Result 94584 states and 117561 transitions. [2024-11-06 20:16:58,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:16:58,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 850 [2024-11-06 20:16:58,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:16:58,261 INFO L225 Difference]: With dead ends: 94584 [2024-11-06 20:16:58,261 INFO L226 Difference]: Without dead ends: 62395 [2024-11-06 20:16:58,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 849 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:16:58,280 INFO L432 NwaCegarLoop]: 1127 mSDtfsCounter, 1565 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 4165 mSolverCounterSat, 1912 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 6077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1912 IncrementalHoareTripleChecker+Valid, 4165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:16:58,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 1259 Invalid, 6077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1912 Valid, 4165 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-06 20:16:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62395 states. [2024-11-06 20:16:58,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62395 to 60903. [2024-11-06 20:16:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60903 states, 60902 states have (on average 1.2042297461495517) internal successors, (73340), 60902 states have internal predecessors, (73340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:58,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60903 states to 60903 states and 73340 transitions. [2024-11-06 20:16:58,863 INFO L78 Accepts]: Start accepts. Automaton has 60903 states and 73340 transitions. Word has length 850 [2024-11-06 20:16:58,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:16:58,864 INFO L471 AbstractCegarLoop]: Abstraction has 60903 states and 73340 transitions. [2024-11-06 20:16:58,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 60903 states and 73340 transitions. [2024-11-06 20:16:58,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 917 [2024-11-06 20:16:58,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:16:58,873 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:16:58,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 20:16:59,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:16:59,074 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:16:59,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:16:59,075 INFO L85 PathProgramCache]: Analyzing trace with hash 454334267, now seen corresponding path program 1 times [2024-11-06 20:16:59,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:16:59,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520959342] [2024-11-06 20:16:59,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:16:59,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:16:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:17:00,567 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-11-06 20:17:00,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:17:00,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520959342] [2024-11-06 20:17:00,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520959342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:17:00,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:17:00,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:17:00,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385097885] [2024-11-06 20:17:00,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:17:00,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:17:00,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:17:00,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:17:00,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:17:00,572 INFO L87 Difference]: Start difference. First operand 60903 states and 73340 transitions. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)