./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_8.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/locks/test_locks_8.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', 'b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337'] 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/locks/test_locks_8.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 b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:51:12,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:51:12,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 18:51:12,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:51:12,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:51:12,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:51:12,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:51:12,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:51:12,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:51:12,400 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:51:12,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:51:12,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:51:12,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:51:12,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:51:12,401 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:51:12,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:51:12,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:51:12,401 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:51:12,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:51:12,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:51:12,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:51:12,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:51:12,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:51:12,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:51:12,405 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:51:12,405 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:51:12,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:51:12,405 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:51:12,406 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:51:12,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:51:12,406 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:51:12,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:51:12,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:51:12,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:51:12,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:51:12,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:51:12,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:51:12,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:51:12,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:51:12,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:51:12,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:51:12,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:51:12,407 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 -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2024-11-06 18:51:12,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:51:12,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:51:12,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:51:12,642 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:51:12,642 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:51:12,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2024-11-06 18:51:13,891 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:51:14,060 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:51:14,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2024-11-06 18:51:14,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f21636868/f2aa3f6703514232b339cd5f5c4a510d/FLAG6bd498e79 [2024-11-06 18:51:14,079 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f21636868/f2aa3f6703514232b339cd5f5c4a510d [2024-11-06 18:51:14,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:51:14,083 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:51:14,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:51:14,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:51:14,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:51:14,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:51:14" (1/1) ... [2024-11-06 18:51:14,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19578a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:51:14, skipping insertion in model container [2024-11-06 18:51:14,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:51:14" (1/1) ... [2024-11-06 18:51:14,103 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:51:14,206 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/locks/test_locks_8.c[3218,3231] [2024-11-06 18:51:14,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:51:14,217 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:51:14,232 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/locks/test_locks_8.c[3218,3231] [2024-11-06 18:51:14,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:51:14,246 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:51:14,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:51:14 WrapperNode [2024-11-06 18:51:14,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:51:14,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:51:14,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:51:14,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:51:14,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:51:14" (1/1) ... [2024-11-06 18:51:14,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:51:14" (1/1) ... [2024-11-06 18:51:14,271 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2024-11-06 18:51:14,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:51:14,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:51:14,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:51:14,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:51:14,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:51:14" (1/1) ... [2024-11-06 18:51:14,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:51:14" (1/1) ... [2024-11-06 18:51:14,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:51:14" (1/1) ... [2024-11-06 18:51:14,295 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 18:51:14,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:51:14" (1/1) ... [2024-11-06 18:51:14,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:51:14" (1/1) ... [2024-11-06 18:51:14,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:51:14" (1/1) ... [2024-11-06 18:51:14,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:51:14" (1/1) ... [2024-11-06 18:51:14,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:51:14" (1/1) ... [2024-11-06 18:51:14,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:51:14" (1/1) ... [2024-11-06 18:51:14,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:51:14,307 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:51:14,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:51:14,307 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:51:14,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:51:14" (1/1) ... [2024-11-06 18:51:14,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:51:14,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:51:14,333 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 18:51:14,337 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 18:51:14,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:51:14,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:51:14,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:51:14,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:51:14,412 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:51:14,413 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:51:14,580 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-06 18:51:14,580 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:51:14,587 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:51:14,587 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 18:51:14,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:51:14 BoogieIcfgContainer [2024-11-06 18:51:14,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:51:14,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:51:14,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:51:14,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:51:14,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:51:14" (1/3) ... [2024-11-06 18:51:14,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228625d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:51:14, skipping insertion in model container [2024-11-06 18:51:14,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:51:14" (2/3) ... [2024-11-06 18:51:14,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228625d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:51:14, skipping insertion in model container [2024-11-06 18:51:14,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:51:14" (3/3) ... [2024-11-06 18:51:14,597 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2024-11-06 18:51:14,608 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:51:14,608 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:51:14,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:51:14,663 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;@f7e59a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:51:14,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:51:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 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 18:51:14,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 18:51:14,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:14,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:14,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:14,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:14,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1577492323, now seen corresponding path program 1 times [2024-11-06 18:51:14,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:14,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639854821] [2024-11-06 18:51:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:14,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:14,826 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 18:51:14,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:14,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639854821] [2024-11-06 18:51:14,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639854821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:14,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:14,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:14,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892985681] [2024-11-06 18:51:14,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:14,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:14,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:14,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:14,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:14,849 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 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 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 18:51:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:14,877 INFO L93 Difference]: Finished difference Result 69 states and 120 transitions. [2024-11-06 18:51:14,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:14,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2024-11-06 18:51:14,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:14,884 INFO L225 Difference]: With dead ends: 69 [2024-11-06 18:51:14,884 INFO L226 Difference]: Without dead ends: 57 [2024-11-06 18:51:14,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:14,889 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 40 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:14,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 113 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:14,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-06 18:51:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2024-11-06 18:51:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 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 18:51:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 70 transitions. [2024-11-06 18:51:14,923 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 70 transitions. Word has length 15 [2024-11-06 18:51:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:14,924 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 70 transitions. [2024-11-06 18:51:14,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 18:51:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 70 transitions. [2024-11-06 18:51:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 18:51:14,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:14,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:14,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 18:51:14,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:14,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:14,927 INFO L85 PathProgramCache]: Analyzing trace with hash -876427745, now seen corresponding path program 1 times [2024-11-06 18:51:14,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:14,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506026226] [2024-11-06 18:51:14,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:14,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:14,980 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 18:51:14,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:14,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506026226] [2024-11-06 18:51:14,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506026226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:14,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:14,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:14,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789412344] [2024-11-06 18:51:14,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:14,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:14,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:14,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:14,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:14,983 INFO L87 Difference]: Start difference. First operand 39 states and 70 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 18:51:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:15,000 INFO L93 Difference]: Finished difference Result 94 states and 169 transitions. [2024-11-06 18:51:15,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:15,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2024-11-06 18:51:15,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:15,001 INFO L225 Difference]: With dead ends: 94 [2024-11-06 18:51:15,001 INFO L226 Difference]: Without dead ends: 57 [2024-11-06 18:51:15,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:15,001 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 38 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:15,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 115 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:15,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-06 18:51:15,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-11-06 18:51:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 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 18:51:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2024-11-06 18:51:15,007 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 15 [2024-11-06 18:51:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:15,007 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2024-11-06 18:51:15,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 18:51:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2024-11-06 18:51:15,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-06 18:51:15,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:15,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:15,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 18:51:15,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:15,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:15,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1657407761, now seen corresponding path program 1 times [2024-11-06 18:51:15,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:15,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134292385] [2024-11-06 18:51:15,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:15,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:15,063 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 18:51:15,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:15,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134292385] [2024-11-06 18:51:15,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134292385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:15,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:15,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:15,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669126346] [2024-11-06 18:51:15,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:15,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:15,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:15,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:15,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:15,064 INFO L87 Difference]: Start difference. First operand 55 states and 98 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 18:51:15,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:15,080 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2024-11-06 18:51:15,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:15,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2024-11-06 18:51:15,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:15,081 INFO L225 Difference]: With dead ends: 87 [2024-11-06 18:51:15,081 INFO L226 Difference]: Without dead ends: 60 [2024-11-06 18:51:15,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:15,082 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 40 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:15,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:15,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-06 18:51:15,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-06 18:51:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 57 states have internal predecessors, (100), 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 18:51:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2024-11-06 18:51:15,086 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 16 [2024-11-06 18:51:15,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:15,086 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2024-11-06 18:51:15,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 18:51:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2024-11-06 18:51:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-06 18:51:15,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:15,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:15,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 18:51:15,087 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:15,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:15,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1399242323, now seen corresponding path program 1 times [2024-11-06 18:51:15,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:15,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63880390] [2024-11-06 18:51:15,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:15,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:15,121 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 18:51:15,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:15,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63880390] [2024-11-06 18:51:15,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63880390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:15,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:15,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:15,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998509298] [2024-11-06 18:51:15,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:15,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:15,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:15,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:15,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:15,122 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 18:51:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:15,139 INFO L93 Difference]: Finished difference Result 109 states and 189 transitions. [2024-11-06 18:51:15,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:15,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2024-11-06 18:51:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:15,140 INFO L225 Difference]: With dead ends: 109 [2024-11-06 18:51:15,140 INFO L226 Difference]: Without dead ends: 107 [2024-11-06 18:51:15,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:15,141 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 35 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:15,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 101 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:15,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-06 18:51:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2024-11-06 18:51:15,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.75) internal successors, (133), 76 states have internal predecessors, (133), 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 18:51:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 133 transitions. [2024-11-06 18:51:15,147 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 133 transitions. Word has length 16 [2024-11-06 18:51:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:15,147 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 133 transitions. [2024-11-06 18:51:15,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 18:51:15,147 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 133 transitions. [2024-11-06 18:51:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-06 18:51:15,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:15,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:15,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 18:51:15,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:15,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:15,148 INFO L85 PathProgramCache]: Analyzing trace with hash -698177745, now seen corresponding path program 1 times [2024-11-06 18:51:15,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:15,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471439780] [2024-11-06 18:51:15,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:15,193 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 18:51:15,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:15,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471439780] [2024-11-06 18:51:15,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471439780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:15,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:15,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:15,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369596124] [2024-11-06 18:51:15,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:15,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:15,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:15,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:15,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:15,195 INFO L87 Difference]: Start difference. First operand 77 states and 133 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 18:51:15,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:15,210 INFO L93 Difference]: Finished difference Result 181 states and 315 transitions. [2024-11-06 18:51:15,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:15,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2024-11-06 18:51:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:15,213 INFO L225 Difference]: With dead ends: 181 [2024-11-06 18:51:15,213 INFO L226 Difference]: Without dead ends: 109 [2024-11-06 18:51:15,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:15,214 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:15,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 116 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-06 18:51:15,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2024-11-06 18:51:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 106 states have internal predecessors, (183), 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 18:51:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 183 transitions. [2024-11-06 18:51:15,221 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 183 transitions. Word has length 16 [2024-11-06 18:51:15,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:15,221 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 183 transitions. [2024-11-06 18:51:15,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 18:51:15,221 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 183 transitions. [2024-11-06 18:51:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 18:51:15,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:15,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:15,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 18:51:15,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:15,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:15,223 INFO L85 PathProgramCache]: Analyzing trace with hash -426624716, now seen corresponding path program 1 times [2024-11-06 18:51:15,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:15,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147755863] [2024-11-06 18:51:15,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:15,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:15,261 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 18:51:15,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:15,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147755863] [2024-11-06 18:51:15,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147755863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:15,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:15,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:15,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556166920] [2024-11-06 18:51:15,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:15,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:15,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:15,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:15,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:15,263 INFO L87 Difference]: Start difference. First operand 107 states and 183 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 18:51:15,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:15,275 INFO L93 Difference]: Finished difference Result 162 states and 274 transitions. [2024-11-06 18:51:15,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:15,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2024-11-06 18:51:15,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:15,276 INFO L225 Difference]: With dead ends: 162 [2024-11-06 18:51:15,276 INFO L226 Difference]: Without dead ends: 111 [2024-11-06 18:51:15,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:15,277 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 39 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:15,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:15,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-06 18:51:15,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-11-06 18:51:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 108 states have internal predecessors, (183), 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 18:51:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 183 transitions. [2024-11-06 18:51:15,283 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 183 transitions. Word has length 17 [2024-11-06 18:51:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:15,283 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 183 transitions. [2024-11-06 18:51:15,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 18:51:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 183 transitions. [2024-11-06 18:51:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 18:51:15,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:15,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:15,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 18:51:15,284 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:15,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:15,284 INFO L85 PathProgramCache]: Analyzing trace with hash -168459278, now seen corresponding path program 1 times [2024-11-06 18:51:15,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:15,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243187330] [2024-11-06 18:51:15,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:15,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:15,313 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 18:51:15,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:15,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243187330] [2024-11-06 18:51:15,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243187330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:15,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:15,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:15,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450770816] [2024-11-06 18:51:15,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:15,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:15,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:15,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:15,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:15,314 INFO L87 Difference]: Start difference. First operand 109 states and 183 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 18:51:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:15,331 INFO L93 Difference]: Finished difference Result 309 states and 521 transitions. [2024-11-06 18:51:15,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:15,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2024-11-06 18:51:15,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:15,333 INFO L225 Difference]: With dead ends: 309 [2024-11-06 18:51:15,333 INFO L226 Difference]: Without dead ends: 207 [2024-11-06 18:51:15,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:15,333 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:15,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 103 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:15,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-06 18:51:15,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2024-11-06 18:51:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.661764705882353) internal successors, (339), 204 states have internal predecessors, (339), 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 18:51:15,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 339 transitions. [2024-11-06 18:51:15,344 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 339 transitions. Word has length 17 [2024-11-06 18:51:15,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:15,344 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 339 transitions. [2024-11-06 18:51:15,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 18:51:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 339 transitions. [2024-11-06 18:51:15,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 18:51:15,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:15,345 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:15,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 18:51:15,345 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:15,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:15,346 INFO L85 PathProgramCache]: Analyzing trace with hash -869523856, now seen corresponding path program 1 times [2024-11-06 18:51:15,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:15,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719261316] [2024-11-06 18:51:15,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:15,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:15,371 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 18:51:15,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:15,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719261316] [2024-11-06 18:51:15,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719261316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:15,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:15,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:15,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327775518] [2024-11-06 18:51:15,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:15,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:15,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:15,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:15,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:15,373 INFO L87 Difference]: Start difference. First operand 205 states and 339 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 18:51:15,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:15,388 INFO L93 Difference]: Finished difference Result 257 states and 429 transitions. [2024-11-06 18:51:15,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:15,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2024-11-06 18:51:15,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:15,390 INFO L225 Difference]: With dead ends: 257 [2024-11-06 18:51:15,390 INFO L226 Difference]: Without dead ends: 255 [2024-11-06 18:51:15,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:15,391 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 32 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:15,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 134 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:15,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-06 18:51:15,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 205. [2024-11-06 18:51:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.642156862745098) internal successors, (335), 204 states have internal predecessors, (335), 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 18:51:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 335 transitions. [2024-11-06 18:51:15,406 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 335 transitions. Word has length 17 [2024-11-06 18:51:15,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:15,406 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 335 transitions. [2024-11-06 18:51:15,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 18:51:15,406 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 335 transitions. [2024-11-06 18:51:15,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 18:51:15,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:15,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:15,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 18:51:15,411 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:15,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:15,411 INFO L85 PathProgramCache]: Analyzing trace with hash -927055644, now seen corresponding path program 1 times [2024-11-06 18:51:15,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:15,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170430809] [2024-11-06 18:51:15,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:15,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:15,462 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 18:51:15,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:15,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170430809] [2024-11-06 18:51:15,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170430809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:15,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:15,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:15,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287829497] [2024-11-06 18:51:15,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:15,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:15,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:15,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:15,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:15,463 INFO L87 Difference]: Start difference. First operand 205 states and 335 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18:51:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:15,481 INFO L93 Difference]: Finished difference Result 373 states and 617 transitions. [2024-11-06 18:51:15,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:15,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-11-06 18:51:15,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:15,484 INFO L225 Difference]: With dead ends: 373 [2024-11-06 18:51:15,484 INFO L226 Difference]: Without dead ends: 371 [2024-11-06 18:51:15,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:15,485 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 29 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:15,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 97 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:15,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-06 18:51:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 289. [2024-11-06 18:51:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.6076388888888888) internal successors, (463), 288 states have internal predecessors, (463), 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 18:51:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 463 transitions. [2024-11-06 18:51:15,499 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 463 transitions. Word has length 18 [2024-11-06 18:51:15,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:15,499 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 463 transitions. [2024-11-06 18:51:15,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18:51:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 463 transitions. [2024-11-06 18:51:15,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 18:51:15,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:15,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:15,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 18:51:15,504 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:15,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:15,505 INFO L85 PathProgramCache]: Analyzing trace with hash -225991066, now seen corresponding path program 1 times [2024-11-06 18:51:15,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:15,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382346047] [2024-11-06 18:51:15,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:15,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:15,529 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 18:51:15,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382346047] [2024-11-06 18:51:15,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382346047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:15,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:15,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:15,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593866008] [2024-11-06 18:51:15,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:15,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:15,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:15,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:15,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:15,530 INFO L87 Difference]: Start difference. First operand 289 states and 463 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18:51:15,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:15,549 INFO L93 Difference]: Finished difference Result 677 states and 1089 transitions. [2024-11-06 18:51:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:15,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-11-06 18:51:15,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:15,551 INFO L225 Difference]: With dead ends: 677 [2024-11-06 18:51:15,551 INFO L226 Difference]: Without dead ends: 395 [2024-11-06 18:51:15,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:15,552 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 35 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:15,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 118 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:15,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-06 18:51:15,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2024-11-06 18:51:15,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.5790816326530612) internal successors, (619), 392 states have internal predecessors, (619), 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 18:51:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 619 transitions. [2024-11-06 18:51:15,565 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 619 transitions. Word has length 18 [2024-11-06 18:51:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:15,565 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 619 transitions. [2024-11-06 18:51:15,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18:51:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 619 transitions. [2024-11-06 18:51:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 18:51:15,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:15,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:15,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 18:51:15,568 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:15,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:15,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1326261127, now seen corresponding path program 1 times [2024-11-06 18:51:15,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:15,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084158994] [2024-11-06 18:51:15,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:15,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:15,594 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 18:51:15,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:15,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084158994] [2024-11-06 18:51:15,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084158994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:15,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:15,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:15,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581072106] [2024-11-06 18:51:15,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:15,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:15,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:15,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:15,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:15,596 INFO L87 Difference]: Start difference. First operand 393 states and 619 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 18:51:15,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:15,609 INFO L93 Difference]: Finished difference Result 597 states and 937 transitions. [2024-11-06 18:51:15,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:15,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-11-06 18:51:15,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:15,610 INFO L225 Difference]: With dead ends: 597 [2024-11-06 18:51:15,610 INFO L226 Difference]: Without dead ends: 407 [2024-11-06 18:51:15,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:15,612 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 37 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:15,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-06 18:51:15,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2024-11-06 18:51:15,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.551980198019802) internal successors, (627), 404 states have internal predecessors, (627), 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 18:51:15,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 627 transitions. [2024-11-06 18:51:15,622 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 627 transitions. Word has length 19 [2024-11-06 18:51:15,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:15,622 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 627 transitions. [2024-11-06 18:51:15,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 18:51:15,622 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 627 transitions. [2024-11-06 18:51:15,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 18:51:15,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:15,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:15,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 18:51:15,623 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:15,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:15,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1584426565, now seen corresponding path program 1 times [2024-11-06 18:51:15,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:15,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338656188] [2024-11-06 18:51:15,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:15,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:15,641 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 18:51:15,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:15,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338656188] [2024-11-06 18:51:15,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338656188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:15,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:15,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:15,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437742025] [2024-11-06 18:51:15,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:15,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:15,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:15,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:15,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:15,642 INFO L87 Difference]: Start difference. First operand 405 states and 627 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 18:51:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:15,658 INFO L93 Difference]: Finished difference Result 713 states and 1117 transitions. [2024-11-06 18:51:15,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:15,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-11-06 18:51:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:15,661 INFO L225 Difference]: With dead ends: 713 [2024-11-06 18:51:15,662 INFO L226 Difference]: Without dead ends: 711 [2024-11-06 18:51:15,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:15,663 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 26 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:15,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:15,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-06 18:51:15,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 581. [2024-11-06 18:51:15,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.5086206896551724) internal successors, (875), 580 states have internal predecessors, (875), 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 18:51:15,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 875 transitions. [2024-11-06 18:51:15,680 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 875 transitions. Word has length 19 [2024-11-06 18:51:15,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:15,681 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 875 transitions. [2024-11-06 18:51:15,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 18:51:15,681 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 875 transitions. [2024-11-06 18:51:15,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 18:51:15,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:15,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:15,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 18:51:15,682 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:15,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:15,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2009476153, now seen corresponding path program 1 times [2024-11-06 18:51:15,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:15,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283849041] [2024-11-06 18:51:15,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:15,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:15,711 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 18:51:15,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:15,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283849041] [2024-11-06 18:51:15,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283849041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:15,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:15,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:15,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819752818] [2024-11-06 18:51:15,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:15,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:15,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:15,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:15,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:15,712 INFO L87 Difference]: Start difference. First operand 581 states and 875 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 18:51:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:15,742 INFO L93 Difference]: Finished difference Result 1337 states and 2013 transitions. [2024-11-06 18:51:15,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:15,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-11-06 18:51:15,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:15,745 INFO L225 Difference]: With dead ends: 1337 [2024-11-06 18:51:15,745 INFO L226 Difference]: Without dead ends: 775 [2024-11-06 18:51:15,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:15,747 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 34 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:15,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 119 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:15,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-06 18:51:15,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 773. [2024-11-06 18:51:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4753886010362693) internal successors, (1139), 772 states have internal predecessors, (1139), 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 18:51:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1139 transitions. [2024-11-06 18:51:15,771 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1139 transitions. Word has length 19 [2024-11-06 18:51:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:15,771 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1139 transitions. [2024-11-06 18:51:15,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 18:51:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1139 transitions. [2024-11-06 18:51:15,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-06 18:51:15,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:15,772 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] [2024-11-06 18:51:15,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 18:51:15,772 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:15,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:15,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1872798619, now seen corresponding path program 1 times [2024-11-06 18:51:15,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:15,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714099363] [2024-11-06 18:51:15,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:15,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:15,794 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 18:51:15,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:15,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714099363] [2024-11-06 18:51:15,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714099363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:15,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:15,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:15,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526402764] [2024-11-06 18:51:15,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:15,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:15,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:15,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:15,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:15,795 INFO L87 Difference]: Start difference. First operand 773 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 18:51:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:15,823 INFO L93 Difference]: Finished difference Result 1161 states and 1701 transitions. [2024-11-06 18:51:15,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:15,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-11-06 18:51:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:15,825 INFO L225 Difference]: With dead ends: 1161 [2024-11-06 18:51:15,826 INFO L226 Difference]: Without dead ends: 791 [2024-11-06 18:51:15,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:15,826 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 36 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:15,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:15,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-11-06 18:51:15,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 789. [2024-11-06 18:51:15,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.4454314720812182) internal successors, (1139), 788 states have internal predecessors, (1139), 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 18:51:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1139 transitions. [2024-11-06 18:51:15,856 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1139 transitions. Word has length 20 [2024-11-06 18:51:15,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:15,856 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1139 transitions. [2024-11-06 18:51:15,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 18:51:15,856 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1139 transitions. [2024-11-06 18:51:15,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-06 18:51:15,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:15,857 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] [2024-11-06 18:51:15,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 18:51:15,857 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:15,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:15,858 INFO L85 PathProgramCache]: Analyzing trace with hash 2130964057, now seen corresponding path program 1 times [2024-11-06 18:51:15,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:15,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424367143] [2024-11-06 18:51:15,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:15,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:15,884 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 18:51:15,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:15,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424367143] [2024-11-06 18:51:15,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424367143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:15,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:15,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:15,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553142647] [2024-11-06 18:51:15,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:15,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:15,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:15,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:15,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:15,886 INFO L87 Difference]: Start difference. First operand 789 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 18:51:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:15,919 INFO L93 Difference]: Finished difference Result 1353 states and 1973 transitions. [2024-11-06 18:51:15,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:15,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-11-06 18:51:15,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:15,923 INFO L225 Difference]: With dead ends: 1353 [2024-11-06 18:51:15,923 INFO L226 Difference]: Without dead ends: 1351 [2024-11-06 18:51:15,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:15,925 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 23 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:15,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 93 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:15,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2024-11-06 18:51:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1157. [2024-11-06 18:51:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.4005190311418685) internal successors, (1619), 1156 states have internal predecessors, (1619), 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 18:51:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1619 transitions. [2024-11-06 18:51:15,956 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1619 transitions. Word has length 20 [2024-11-06 18:51:15,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:15,956 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1619 transitions. [2024-11-06 18:51:15,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 18:51:15,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1619 transitions. [2024-11-06 18:51:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-06 18:51:15,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:15,958 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] [2024-11-06 18:51:15,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 18:51:15,959 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:15,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:15,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1462938661, now seen corresponding path program 1 times [2024-11-06 18:51:15,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:15,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617612297] [2024-11-06 18:51:15,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:15,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:15,980 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 18:51:15,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:15,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617612297] [2024-11-06 18:51:15,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617612297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:15,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:15,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:15,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075856810] [2024-11-06 18:51:15,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:15,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:15,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:15,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:15,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:15,982 INFO L87 Difference]: Start difference. First operand 1157 states and 1619 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 18:51:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:16,014 INFO L93 Difference]: Finished difference Result 2633 states and 3669 transitions. [2024-11-06 18:51:16,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:16,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-11-06 18:51:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:16,019 INFO L225 Difference]: With dead ends: 2633 [2024-11-06 18:51:16,019 INFO L226 Difference]: Without dead ends: 1511 [2024-11-06 18:51:16,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:16,023 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 33 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:16,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2024-11-06 18:51:16,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1509. [2024-11-06 18:51:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 1.360079575596817) internal successors, (2051), 1508 states have internal predecessors, (2051), 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 18:51:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2051 transitions. [2024-11-06 18:51:16,072 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2051 transitions. Word has length 20 [2024-11-06 18:51:16,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:16,073 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 2051 transitions. [2024-11-06 18:51:16,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 18:51:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2051 transitions. [2024-11-06 18:51:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-06 18:51:16,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:16,075 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] [2024-11-06 18:51:16,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 18:51:16,075 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:16,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:16,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1635592028, now seen corresponding path program 1 times [2024-11-06 18:51:16,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:16,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475930328] [2024-11-06 18:51:16,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:16,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:16,095 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 18:51:16,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475930328] [2024-11-06 18:51:16,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475930328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:16,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:16,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:16,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335300929] [2024-11-06 18:51:16,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:16,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:16,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:16,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:16,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:16,096 INFO L87 Difference]: Start difference. First operand 1509 states and 2051 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 18:51:16,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:16,126 INFO L93 Difference]: Finished difference Result 2265 states and 3061 transitions. [2024-11-06 18:51:16,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:16,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-11-06 18:51:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:16,130 INFO L225 Difference]: With dead ends: 2265 [2024-11-06 18:51:16,130 INFO L226 Difference]: Without dead ends: 1543 [2024-11-06 18:51:16,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:16,132 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:16,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 108 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:16,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2024-11-06 18:51:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1541. [2024-11-06 18:51:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.3318181818181818) internal successors, (2051), 1540 states have internal predecessors, (2051), 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 18:51:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2051 transitions. [2024-11-06 18:51:16,170 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2051 transitions. Word has length 21 [2024-11-06 18:51:16,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:16,171 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 2051 transitions. [2024-11-06 18:51:16,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 18:51:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2051 transitions. [2024-11-06 18:51:16,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-06 18:51:16,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:16,173 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] [2024-11-06 18:51:16,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 18:51:16,173 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:16,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:16,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1893757466, now seen corresponding path program 1 times [2024-11-06 18:51:16,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:16,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655167924] [2024-11-06 18:51:16,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:16,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:16,191 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 18:51:16,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:16,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655167924] [2024-11-06 18:51:16,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655167924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:16,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:16,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:16,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244602503] [2024-11-06 18:51:16,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:16,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:16,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:16,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:16,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:16,196 INFO L87 Difference]: Start difference. First operand 1541 states and 2051 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 18:51:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:16,242 INFO L93 Difference]: Finished difference Result 2569 states and 3429 transitions. [2024-11-06 18:51:16,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:16,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-11-06 18:51:16,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:16,249 INFO L225 Difference]: With dead ends: 2569 [2024-11-06 18:51:16,249 INFO L226 Difference]: Without dead ends: 2567 [2024-11-06 18:51:16,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:16,251 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:16,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:16,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2024-11-06 18:51:16,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2309. [2024-11-06 18:51:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.290727902946274) internal successors, (2979), 2308 states have internal predecessors, (2979), 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 18:51:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 2979 transitions. [2024-11-06 18:51:16,305 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 2979 transitions. Word has length 21 [2024-11-06 18:51:16,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:16,305 INFO L471 AbstractCegarLoop]: Abstraction has 2309 states and 2979 transitions. [2024-11-06 18:51:16,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 18:51:16,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2979 transitions. [2024-11-06 18:51:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-06 18:51:16,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:16,308 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] [2024-11-06 18:51:16,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 18:51:16,308 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:16,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:16,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1700145252, now seen corresponding path program 1 times [2024-11-06 18:51:16,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:16,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26790763] [2024-11-06 18:51:16,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:16,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:16,325 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 18:51:16,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:16,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26790763] [2024-11-06 18:51:16,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26790763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:16,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:16,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:16,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570483983] [2024-11-06 18:51:16,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:16,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:16,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:16,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:16,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:16,327 INFO L87 Difference]: Start difference. First operand 2309 states and 2979 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 18:51:16,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:16,376 INFO L93 Difference]: Finished difference Result 5193 states and 6629 transitions. [2024-11-06 18:51:16,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:16,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-11-06 18:51:16,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:16,384 INFO L225 Difference]: With dead ends: 5193 [2024-11-06 18:51:16,384 INFO L226 Difference]: Without dead ends: 2951 [2024-11-06 18:51:16,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:16,386 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 32 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:16,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 121 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2024-11-06 18:51:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2949. [2024-11-06 18:51:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2948 states have (on average 1.2384667571234735) internal successors, (3651), 2948 states have internal predecessors, (3651), 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 18:51:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3651 transitions. [2024-11-06 18:51:16,468 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3651 transitions. Word has length 21 [2024-11-06 18:51:16,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:16,469 INFO L471 AbstractCegarLoop]: Abstraction has 2949 states and 3651 transitions. [2024-11-06 18:51:16,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 18:51:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3651 transitions. [2024-11-06 18:51:16,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-06 18:51:16,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:16,472 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] [2024-11-06 18:51:16,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-06 18:51:16,472 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:16,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:16,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1422844656, now seen corresponding path program 1 times [2024-11-06 18:51:16,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:16,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100444214] [2024-11-06 18:51:16,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:16,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:16,487 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 18:51:16,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:16,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100444214] [2024-11-06 18:51:16,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100444214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:16,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:16,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:16,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810977028] [2024-11-06 18:51:16,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:16,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:16,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:16,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:16,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:16,488 INFO L87 Difference]: Start difference. First operand 2949 states and 3651 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 18:51:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:16,546 INFO L93 Difference]: Finished difference Result 4425 states and 5445 transitions. [2024-11-06 18:51:16,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:16,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2024-11-06 18:51:16,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:16,556 INFO L225 Difference]: With dead ends: 4425 [2024-11-06 18:51:16,556 INFO L226 Difference]: Without dead ends: 3015 [2024-11-06 18:51:16,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:16,559 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 34 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:16,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 104 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2024-11-06 18:51:16,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 3013. [2024-11-06 18:51:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 3012 states have (on average 1.2121513944223108) internal successors, (3651), 3012 states have internal predecessors, (3651), 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 18:51:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 3651 transitions. [2024-11-06 18:51:16,658 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 3651 transitions. Word has length 22 [2024-11-06 18:51:16,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:16,658 INFO L471 AbstractCegarLoop]: Abstraction has 3013 states and 3651 transitions. [2024-11-06 18:51:16,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 18:51:16,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 3651 transitions. [2024-11-06 18:51:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-06 18:51:16,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:16,662 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] [2024-11-06 18:51:16,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-06 18:51:16,662 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:16,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:16,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1164679218, now seen corresponding path program 1 times [2024-11-06 18:51:16,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:16,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468378166] [2024-11-06 18:51:16,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:16,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:16,681 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 18:51:16,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:16,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468378166] [2024-11-06 18:51:16,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468378166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:16,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:16,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:16,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247505226] [2024-11-06 18:51:16,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:16,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:16,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:16,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:16,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:16,684 INFO L87 Difference]: Start difference. First operand 3013 states and 3651 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 18:51:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:16,753 INFO L93 Difference]: Finished difference Result 4871 states and 5828 transitions. [2024-11-06 18:51:16,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:16,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2024-11-06 18:51:16,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:16,769 INFO L225 Difference]: With dead ends: 4871 [2024-11-06 18:51:16,769 INFO L226 Difference]: Without dead ends: 4869 [2024-11-06 18:51:16,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:16,771 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:16,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 88 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:16,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2024-11-06 18:51:16,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4613. [2024-11-06 18:51:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4613 states, 4612 states have (on average 1.180182133564614) internal successors, (5443), 4612 states have internal predecessors, (5443), 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 18:51:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 5443 transitions. [2024-11-06 18:51:16,916 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 5443 transitions. Word has length 22 [2024-11-06 18:51:16,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:16,917 INFO L471 AbstractCegarLoop]: Abstraction has 4613 states and 5443 transitions. [2024-11-06 18:51:16,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 18:51:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 5443 transitions. [2024-11-06 18:51:16,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-06 18:51:16,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:16,923 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] [2024-11-06 18:51:16,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-06 18:51:16,923 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:16,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:16,923 INFO L85 PathProgramCache]: Analyzing trace with hash -463614640, now seen corresponding path program 1 times [2024-11-06 18:51:16,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:51:16,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755222389] [2024-11-06 18:51:16,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:16,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:51:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:16,947 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 18:51:16,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:51:16,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755222389] [2024-11-06 18:51:16,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755222389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:16,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:16,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:51:16,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584887320] [2024-11-06 18:51:16,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:16,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:51:16,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:51:16,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:51:16,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:51:16,949 INFO L87 Difference]: Start difference. First operand 4613 states and 5443 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 18:51:17,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:17,064 INFO L93 Difference]: Finished difference Result 10245 states and 11843 transitions. [2024-11-06 18:51:17,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:51:17,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2024-11-06 18:51:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:17,065 INFO L225 Difference]: With dead ends: 10245 [2024-11-06 18:51:17,065 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 18:51:17,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:51:17,075 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 30 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:17,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 18:51:17,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 18:51:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 18:51:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 18:51:17,077 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2024-11-06 18:51:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:17,077 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 18:51:17,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 18:51:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 18:51:17,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 18:51:17,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:51:17,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-06 18:51:17,085 INFO L407 BasicCegarLoop]: Path program histogram: [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 18:51:17,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 18:51:17,094 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:51:17,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:51:17 BoogieIcfgContainer [2024-11-06 18:51:17,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:51:17,103 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:51:17,103 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:51:17,103 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:51:17,104 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:51:14" (3/4) ... [2024-11-06 18:51:17,105 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 18:51:17,113 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-06 18:51:17,113 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 18:51:17,114 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 18:51:17,114 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 18:51:17,168 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 18:51:17,169 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 18:51:17,169 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:51:17,170 INFO L158 Benchmark]: Toolchain (without parser) took 3086.72ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 92.4MB in the beginning and 221.1MB in the end (delta: -128.7MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-06 18:51:17,170 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:51:17,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.21ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 81.0MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:51:17,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.00ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 79.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:51:17,171 INFO L158 Benchmark]: Boogie Preprocessor took 33.15ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.3MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:51:17,171 INFO L158 Benchmark]: RCFGBuilder took 281.54ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 65.5MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:51:17,171 INFO L158 Benchmark]: TraceAbstraction took 2512.15ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 65.0MB in the beginning and 227.8MB in the end (delta: -162.7MB). Peak memory consumption was 126.5MB. Max. memory is 16.1GB. [2024-11-06 18:51:17,172 INFO L158 Benchmark]: Witness Printer took 65.95ms. Allocated memory is still 260.0MB. Free memory was 227.8MB in the beginning and 221.1MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:51:17,172 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.21ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 81.0MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.00ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 79.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.15ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.3MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 281.54ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 65.5MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2512.15ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 65.0MB in the beginning and 227.8MB in the end (delta: -162.7MB). Peak memory consumption was 126.5MB. Max. memory is 16.1GB. * Witness Printer took 65.95ms. Allocated memory is still 260.0MB. Free memory was 227.8MB in the beginning and 221.1MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 135]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 718 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 718 mSDsluCounter, 2436 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 963 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 119 IncrementalHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1473 mSDtfsCounter, 119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4613occurred in iteration=21, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 389 ConstructedInterpolants, 0 QuantifiedInterpolants, 805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-11-06 18:51:17,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE