./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 64bit --witnessprinter.graph.data.programhash cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:07:39,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:07:39,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-20 02:07:39,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:07:39,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:07:39,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:07:39,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:07:39,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:07:39,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:07:39,519 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:07:39,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:07:39,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:07:39,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:07:39,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:07:39,524 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:07:39,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:07:39,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:07:39,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:07:39,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:07:39,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:07:39,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:07:39,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:07:39,527 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:07:39,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:07:39,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:07:39,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:07:39,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:07:39,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:07:39,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:07:39,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:07:39,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:07:39,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:07:39,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:07:39,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:07:39,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:07:39,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:07:39,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:07:39,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:07:39,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:07:39,530 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d [2024-11-20 02:07:39,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:07:39,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:07:39,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:07:39,749 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:07:39,751 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:07:39,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-20 02:07:41,165 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:07:41,419 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:07:41,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-20 02:07:41,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/250a101a7/acd7274d614d40058cb48161806eaffc/FLAGf5887164c [2024-11-20 02:07:41,776 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/250a101a7/acd7274d614d40058cb48161806eaffc [2024-11-20 02:07:41,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:07:41,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:07:41,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:07:41,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:07:41,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:07:41,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:07:41" (1/1) ... [2024-11-20 02:07:41,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@661a6719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:07:41, skipping insertion in model container [2024-11-20 02:07:41,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:07:41" (1/1) ... [2024-11-20 02:07:41,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:07:41,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2024-11-20 02:07:42,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:07:42,080 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:07:42,093 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2024-11-20 02:07:42,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:07:42,170 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:07:42,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:07:42 WrapperNode [2024-11-20 02:07:42,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:07:42,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:07:42,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:07:42,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:07:42,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:07:42" (1/1) ... [2024-11-20 02:07:42,193 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:07:42" (1/1) ... [2024-11-20 02:07:42,273 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 458 [2024-11-20 02:07:42,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:07:42,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:07:42,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:07:42,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:07:42,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:07:42" (1/1) ... [2024-11-20 02:07:42,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:07:42" (1/1) ... [2024-11-20 02:07:42,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:07:42" (1/1) ... [2024-11-20 02:07:42,328 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-20 02:07:42,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:07:42" (1/1) ... [2024-11-20 02:07:42,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:07:42" (1/1) ... [2024-11-20 02:07:42,349 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:07:42" (1/1) ... [2024-11-20 02:07:42,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:07:42" (1/1) ... [2024-11-20 02:07:42,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:07:42" (1/1) ... [2024-11-20 02:07:42,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:07:42" (1/1) ... [2024-11-20 02:07:42,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:07:42,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:07:42,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:07:42,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:07:42,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:07:42" (1/1) ... [2024-11-20 02:07:42,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:07:42,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:07:42,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:07:42,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:07:42,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:07:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:07:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:07:42,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:07:42,554 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:07:42,555 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:07:43,044 INFO L? ?]: Removed 232 outVars from TransFormulas that were not future-live. [2024-11-20 02:07:43,045 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:07:43,054 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:07:43,054 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:07:43,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:07:43 BoogieIcfgContainer [2024-11-20 02:07:43,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:07:43,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:07:43,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:07:43,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:07:43,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:07:41" (1/3) ... [2024-11-20 02:07:43,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335212a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:07:43, skipping insertion in model container [2024-11-20 02:07:43,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:07:42" (2/3) ... [2024-11-20 02:07:43,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335212a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:07:43, skipping insertion in model container [2024-11-20 02:07:43,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:07:43" (3/3) ... [2024-11-20 02:07:43,060 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-20 02:07:43,071 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:07:43,071 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:07:43,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:07:43,113 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;@48607a9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:07:43,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:07:43,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 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-20 02:07:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 02:07:43,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:43,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:43,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:43,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:43,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1135438275, now seen corresponding path program 1 times [2024-11-20 02:07:43,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:43,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295109288] [2024-11-20 02:07:43,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:43,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:43,557 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-20 02:07:43,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:43,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295109288] [2024-11-20 02:07:43,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295109288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:43,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:43,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:07:43,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191807512] [2024-11-20 02:07:43,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:43,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:07:43,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:43,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:07:43,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:07:43,586 INFO L87 Difference]: Start difference. First operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-20 02:07:43,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:43,631 INFO L93 Difference]: Finished difference Result 217 states and 321 transitions. [2024-11-20 02:07:43,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:07:43,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-11-20 02:07:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:43,640 INFO L225 Difference]: With dead ends: 217 [2024-11-20 02:07:43,640 INFO L226 Difference]: Without dead ends: 117 [2024-11-20 02:07:43,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:07:43,646 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:43,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 495 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:07:43,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-20 02:07:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-20 02:07:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 116 states have internal predecessors, (171), 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-20 02:07:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2024-11-20 02:07:43,683 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 23 [2024-11-20 02:07:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:43,683 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2024-11-20 02:07:43,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-20 02:07:43,684 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2024-11-20 02:07:43,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 02:07:43,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:43,685 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:43,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:07:43,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:43,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:43,686 INFO L85 PathProgramCache]: Analyzing trace with hash 840543427, now seen corresponding path program 1 times [2024-11-20 02:07:43,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:43,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256517871] [2024-11-20 02:07:43,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:43,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:43,783 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-20 02:07:43,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:43,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256517871] [2024-11-20 02:07:43,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256517871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:43,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:43,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:07:43,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039305175] [2024-11-20 02:07:43,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:43,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:07:43,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:43,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:07:43,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:07:43,789 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-20 02:07:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:43,828 INFO L93 Difference]: Finished difference Result 218 states and 319 transitions. [2024-11-20 02:07:43,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:07:43,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2024-11-20 02:07:43,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:43,829 INFO L225 Difference]: With dead ends: 218 [2024-11-20 02:07:43,829 INFO L226 Difference]: Without dead ends: 119 [2024-11-20 02:07:43,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:07:43,831 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:43,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:07:43,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-20 02:07:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-20 02:07:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 118 states have internal predecessors, (173), 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-20 02:07:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2024-11-20 02:07:43,838 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 24 [2024-11-20 02:07:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:43,839 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2024-11-20 02:07:43,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-20 02:07:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2024-11-20 02:07:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-20 02:07:43,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:43,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:43,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:07:43,840 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:43,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:43,841 INFO L85 PathProgramCache]: Analyzing trace with hash -810923364, now seen corresponding path program 1 times [2024-11-20 02:07:43,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:43,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395563845] [2024-11-20 02:07:43,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:43,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:44,059 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-20 02:07:44,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:44,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395563845] [2024-11-20 02:07:44,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395563845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:44,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:44,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 02:07:44,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441732083] [2024-11-20 02:07:44,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:44,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 02:07:44,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:44,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 02:07:44,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:07:44,065 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-20 02:07:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:44,138 INFO L93 Difference]: Finished difference Result 231 states and 337 transitions. [2024-11-20 02:07:44,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 02:07:44,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 25 [2024-11-20 02:07:44,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:44,140 INFO L225 Difference]: With dead ends: 231 [2024-11-20 02:07:44,140 INFO L226 Difference]: Without dead ends: 130 [2024-11-20 02:07:44,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:07:44,142 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 26 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:44,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 927 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:07:44,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-20 02:07:44,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2024-11-20 02:07:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.453125) internal successors, (186), 128 states have internal predecessors, (186), 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-20 02:07:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 186 transitions. [2024-11-20 02:07:44,150 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 186 transitions. Word has length 25 [2024-11-20 02:07:44,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:44,150 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 186 transitions. [2024-11-20 02:07:44,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-20 02:07:44,151 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 186 transitions. [2024-11-20 02:07:44,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-20 02:07:44,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:44,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:44,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 02:07:44,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:44,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:44,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1540066410, now seen corresponding path program 1 times [2024-11-20 02:07:44,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:44,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399801373] [2024-11-20 02:07:44,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:44,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:44,463 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-20 02:07:44,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:44,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399801373] [2024-11-20 02:07:44,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399801373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:44,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:44,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 02:07:44,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022398464] [2024-11-20 02:07:44,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:44,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 02:07:44,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:44,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 02:07:44,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:07:44,467 INFO L87 Difference]: Start difference. First operand 129 states and 186 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-20 02:07:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:44,598 INFO L93 Difference]: Finished difference Result 305 states and 441 transitions. [2024-11-20 02:07:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 02:07:44,599 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 26 [2024-11-20 02:07:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:44,600 INFO L225 Difference]: With dead ends: 305 [2024-11-20 02:07:44,600 INFO L226 Difference]: Without dead ends: 204 [2024-11-20 02:07:44,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-20 02:07:44,601 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 130 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:44,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1203 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:07:44,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-20 02:07:44,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 131. [2024-11-20 02:07:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4461538461538461) internal successors, (188), 130 states have internal predecessors, (188), 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-20 02:07:44,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2024-11-20 02:07:44,607 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 26 [2024-11-20 02:07:44,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:44,607 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2024-11-20 02:07:44,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-20 02:07:44,607 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2024-11-20 02:07:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-20 02:07:44,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:44,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:44,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 02:07:44,608 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:44,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:44,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1685236529, now seen corresponding path program 1 times [2024-11-20 02:07:44,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:44,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599865460] [2024-11-20 02:07:44,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:44,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:44,734 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-20 02:07:44,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:44,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599865460] [2024-11-20 02:07:44,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599865460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:44,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:44,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 02:07:44,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643301236] [2024-11-20 02:07:44,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:44,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 02:07:44,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:44,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 02:07:44,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:07:44,735 INFO L87 Difference]: Start difference. First operand 131 states and 188 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-20 02:07:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:44,812 INFO L93 Difference]: Finished difference Result 303 states and 434 transitions. [2024-11-20 02:07:44,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 02:07:44,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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 26 [2024-11-20 02:07:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:44,814 INFO L225 Difference]: With dead ends: 303 [2024-11-20 02:07:44,814 INFO L226 Difference]: Without dead ends: 193 [2024-11-20 02:07:44,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-20 02:07:44,815 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 109 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:44,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 910 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:07:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-20 02:07:44,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 132. [2024-11-20 02:07:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.4351145038167938) internal successors, (188), 131 states have internal predecessors, (188), 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-20 02:07:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2024-11-20 02:07:44,823 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 26 [2024-11-20 02:07:44,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:44,823 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2024-11-20 02:07:44,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-20 02:07:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2024-11-20 02:07:44,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 02:07:44,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:44,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:44,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 02:07:44,824 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:44,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:44,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1487729941, now seen corresponding path program 1 times [2024-11-20 02:07:44,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:44,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673249410] [2024-11-20 02:07:44,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:44,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:44,881 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-20 02:07:44,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:44,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673249410] [2024-11-20 02:07:44,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673249410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:44,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:44,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:07:44,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376617992] [2024-11-20 02:07:44,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:44,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:07:44,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:44,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:07:44,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:07:44,883 INFO L87 Difference]: Start difference. First operand 132 states and 188 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-20 02:07:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:44,906 INFO L93 Difference]: Finished difference Result 283 states and 405 transitions. [2024-11-20 02:07:44,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:07:44,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2024-11-20 02:07:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:44,906 INFO L225 Difference]: With dead ends: 283 [2024-11-20 02:07:44,907 INFO L226 Difference]: Without dead ends: 173 [2024-11-20 02:07:44,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:07:44,908 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 89 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:44,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 626 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:07:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-20 02:07:44,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 128. [2024-11-20 02:07:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.4330708661417322) internal successors, (182), 127 states have internal predecessors, (182), 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-20 02:07:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 182 transitions. [2024-11-20 02:07:44,912 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 182 transitions. Word has length 27 [2024-11-20 02:07:44,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:44,912 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 182 transitions. [2024-11-20 02:07:44,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-20 02:07:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 182 transitions. [2024-11-20 02:07:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-20 02:07:44,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:44,914 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:44,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 02:07:44,914 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:44,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:44,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1767100030, now seen corresponding path program 1 times [2024-11-20 02:07:44,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:44,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978506172] [2024-11-20 02:07:44,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:44,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:45,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:45,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978506172] [2024-11-20 02:07:45,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978506172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:45,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:45,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 02:07:45,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571481677] [2024-11-20 02:07:45,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:45,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 02:07:45,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:45,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 02:07:45,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:07:45,200 INFO L87 Difference]: Start difference. First operand 128 states and 182 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-20 02:07:45,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:45,254 INFO L93 Difference]: Finished difference Result 277 states and 399 transitions. [2024-11-20 02:07:45,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 02:07:45,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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 75 [2024-11-20 02:07:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:45,257 INFO L225 Difference]: With dead ends: 277 [2024-11-20 02:07:45,257 INFO L226 Difference]: Without dead ends: 176 [2024-11-20 02:07:45,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-20 02:07:45,258 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 92 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:45,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 794 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:07:45,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-20 02:07:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 145. [2024-11-20 02:07:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4166666666666667) internal successors, (204), 144 states have internal predecessors, (204), 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-20 02:07:45,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 204 transitions. [2024-11-20 02:07:45,263 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 204 transitions. Word has length 75 [2024-11-20 02:07:45,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:45,263 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 204 transitions. [2024-11-20 02:07:45,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-20 02:07:45,264 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 204 transitions. [2024-11-20 02:07:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-20 02:07:45,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:45,265 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:45,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 02:07:45,266 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:45,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2102834484, now seen corresponding path program 1 times [2024-11-20 02:07:45,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:45,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66584925] [2024-11-20 02:07:45,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:45,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:45,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:45,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66584925] [2024-11-20 02:07:45,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66584925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:45,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:45,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 02:07:45,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361613095] [2024-11-20 02:07:45,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:45,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 02:07:45,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:45,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 02:07:45,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:07:45,563 INFO L87 Difference]: Start difference. First operand 145 states and 204 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-20 02:07:45,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:45,594 INFO L93 Difference]: Finished difference Result 254 states and 363 transitions. [2024-11-20 02:07:45,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 02:07:45,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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 76 [2024-11-20 02:07:45,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:45,595 INFO L225 Difference]: With dead ends: 254 [2024-11-20 02:07:45,595 INFO L226 Difference]: Without dead ends: 153 [2024-11-20 02:07:45,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:07:45,596 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 5 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:45,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 809 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:07:45,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-20 02:07:45,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2024-11-20 02:07:45,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.4093959731543624) internal successors, (210), 149 states have internal predecessors, (210), 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-20 02:07:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 210 transitions. [2024-11-20 02:07:45,600 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 210 transitions. Word has length 76 [2024-11-20 02:07:45,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:45,600 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 210 transitions. [2024-11-20 02:07:45,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-20 02:07:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 210 transitions. [2024-11-20 02:07:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 02:07:45,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:45,602 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:45,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 02:07:45,603 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:45,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:45,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1102813423, now seen corresponding path program 1 times [2024-11-20 02:07:45,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:45,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322299472] [2024-11-20 02:07:45,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:45,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:46,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:46,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322299472] [2024-11-20 02:07:46,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322299472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:46,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:46,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 02:07:46,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826678812] [2024-11-20 02:07:46,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:46,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 02:07:46,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:46,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 02:07:46,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:07:46,042 INFO L87 Difference]: Start difference. First operand 150 states and 210 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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-20 02:07:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:46,166 INFO L93 Difference]: Finished difference Result 307 states and 439 transitions. [2024-11-20 02:07:46,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 02:07:46,167 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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 77 [2024-11-20 02:07:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:46,168 INFO L225 Difference]: With dead ends: 307 [2024-11-20 02:07:46,168 INFO L226 Difference]: Without dead ends: 201 [2024-11-20 02:07:46,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-20 02:07:46,169 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 99 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:46,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1204 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:07:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-20 02:07:46,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 168. [2024-11-20 02:07:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.407185628742515) internal successors, (235), 167 states have internal predecessors, (235), 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-20 02:07:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 235 transitions. [2024-11-20 02:07:46,174 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 235 transitions. Word has length 77 [2024-11-20 02:07:46,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:46,174 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 235 transitions. [2024-11-20 02:07:46,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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-20 02:07:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 235 transitions. [2024-11-20 02:07:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 02:07:46,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:46,177 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:46,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 02:07:46,177 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:46,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:46,178 INFO L85 PathProgramCache]: Analyzing trace with hash 599392645, now seen corresponding path program 1 times [2024-11-20 02:07:46,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:46,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479034762] [2024-11-20 02:07:46,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:46,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:46,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:46,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479034762] [2024-11-20 02:07:46,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479034762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:46,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:46,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 02:07:46,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852342661] [2024-11-20 02:07:46,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:46,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 02:07:46,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:46,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 02:07:46,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:07:46,560 INFO L87 Difference]: Start difference. First operand 168 states and 235 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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-20 02:07:46,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:46,632 INFO L93 Difference]: Finished difference Result 292 states and 415 transitions. [2024-11-20 02:07:46,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 02:07:46,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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 78 [2024-11-20 02:07:46,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:46,634 INFO L225 Difference]: With dead ends: 292 [2024-11-20 02:07:46,634 INFO L226 Difference]: Without dead ends: 186 [2024-11-20 02:07:46,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:07:46,635 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 11 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:46,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1290 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:07:46,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-20 02:07:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2024-11-20 02:07:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.4021739130434783) internal successors, (258), 184 states have internal predecessors, (258), 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-20 02:07:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 258 transitions. [2024-11-20 02:07:46,639 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 258 transitions. Word has length 78 [2024-11-20 02:07:46,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:46,639 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 258 transitions. [2024-11-20 02:07:46,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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-20 02:07:46,639 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 258 transitions. [2024-11-20 02:07:46,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 02:07:46,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:46,640 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:46,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 02:07:46,641 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:46,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:46,641 INFO L85 PathProgramCache]: Analyzing trace with hash 985055635, now seen corresponding path program 1 times [2024-11-20 02:07:46,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:46,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725745311] [2024-11-20 02:07:46,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:46,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:46,987 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:46,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:46,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725745311] [2024-11-20 02:07:46,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725745311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:46,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:46,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:07:46,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081851229] [2024-11-20 02:07:46,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:46,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:07:46,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:46,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:07:46,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:07:46,989 INFO L87 Difference]: Start difference. First operand 185 states and 258 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-20 02:07:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:47,000 INFO L93 Difference]: Finished difference Result 308 states and 434 transitions. [2024-11-20 02:07:47,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:07:47,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2024-11-20 02:07:47,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:47,001 INFO L225 Difference]: With dead ends: 308 [2024-11-20 02:07:47,001 INFO L226 Difference]: Without dead ends: 185 [2024-11-20 02:07:47,002 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-20 02:07:47,002 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 2 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 325 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-20 02:07:47,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 325 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:07:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-20 02:07:47,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-20 02:07:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.3967391304347827) internal successors, (257), 184 states have internal predecessors, (257), 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-20 02:07:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 257 transitions. [2024-11-20 02:07:47,006 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 257 transitions. Word has length 78 [2024-11-20 02:07:47,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:47,006 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 257 transitions. [2024-11-20 02:07:47,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-20 02:07:47,007 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 257 transitions. [2024-11-20 02:07:47,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-20 02:07:47,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:47,007 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:47,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 02:07:47,008 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:47,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:47,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1801205834, now seen corresponding path program 1 times [2024-11-20 02:07:47,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:47,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282326406] [2024-11-20 02:07:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:47,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:47,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282326406] [2024-11-20 02:07:47,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282326406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:47,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:47,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 02:07:47,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537168562] [2024-11-20 02:07:47,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:47,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 02:07:47,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:47,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 02:07:47,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-20 02:07:47,487 INFO L87 Difference]: Start difference. First operand 185 states and 257 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 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-20 02:07:47,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:47,658 INFO L93 Difference]: Finished difference Result 360 states and 507 transitions. [2024-11-20 02:07:47,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 02:07:47,658 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 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 79 [2024-11-20 02:07:47,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:47,659 INFO L225 Difference]: With dead ends: 360 [2024-11-20 02:07:47,659 INFO L226 Difference]: Without dead ends: 237 [2024-11-20 02:07:47,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-20 02:07:47,660 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 45 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:47,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1677 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:07:47,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-20 02:07:47,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 215. [2024-11-20 02:07:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.3925233644859814) internal successors, (298), 214 states have internal predecessors, (298), 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-20 02:07:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 298 transitions. [2024-11-20 02:07:47,665 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 298 transitions. Word has length 79 [2024-11-20 02:07:47,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:47,665 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 298 transitions. [2024-11-20 02:07:47,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 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-20 02:07:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 298 transitions. [2024-11-20 02:07:47,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-20 02:07:47,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:47,666 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:47,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 02:07:47,666 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:47,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:47,667 INFO L85 PathProgramCache]: Analyzing trace with hash 28135856, now seen corresponding path program 1 times [2024-11-20 02:07:47,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:47,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699027036] [2024-11-20 02:07:47,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:47,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:48,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:48,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:48,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699027036] [2024-11-20 02:07:48,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699027036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:48,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:48,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 02:07:48,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137022642] [2024-11-20 02:07:48,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:48,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 02:07:48,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:48,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 02:07:48,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-20 02:07:48,343 INFO L87 Difference]: Start difference. First operand 215 states and 298 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 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-20 02:07:48,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:48,528 INFO L93 Difference]: Finished difference Result 423 states and 596 transitions. [2024-11-20 02:07:48,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 02:07:48,529 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 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 80 [2024-11-20 02:07:48,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:48,530 INFO L225 Difference]: With dead ends: 423 [2024-11-20 02:07:48,530 INFO L226 Difference]: Without dead ends: 270 [2024-11-20 02:07:48,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-20 02:07:48,531 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 74 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:48,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1606 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:07:48,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-20 02:07:48,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 258. [2024-11-20 02:07:48,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 1.3891050583657587) internal successors, (357), 257 states have internal predecessors, (357), 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-20 02:07:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 357 transitions. [2024-11-20 02:07:48,535 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 357 transitions. Word has length 80 [2024-11-20 02:07:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:48,536 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 357 transitions. [2024-11-20 02:07:48,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 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-20 02:07:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 357 transitions. [2024-11-20 02:07:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-20 02:07:48,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:48,537 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:48,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 02:07:48,537 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:48,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:48,538 INFO L85 PathProgramCache]: Analyzing trace with hash -118938263, now seen corresponding path program 1 times [2024-11-20 02:07:48,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:48,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262675999] [2024-11-20 02:07:48,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:48,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:48,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:48,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262675999] [2024-11-20 02:07:48,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262675999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:48,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:48,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 02:07:48,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882810669] [2024-11-20 02:07:48,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:48,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 02:07:48,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:48,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 02:07:48,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 02:07:48,947 INFO L87 Difference]: Start difference. First operand 258 states and 357 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 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-20 02:07:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:49,055 INFO L93 Difference]: Finished difference Result 447 states and 624 transitions. [2024-11-20 02:07:49,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 02:07:49,055 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 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 80 [2024-11-20 02:07:49,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:49,056 INFO L225 Difference]: With dead ends: 447 [2024-11-20 02:07:49,056 INFO L226 Difference]: Without dead ends: 294 [2024-11-20 02:07:49,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-20 02:07:49,057 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 29 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:49,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1486 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:07:49,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-20 02:07:49,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 287. [2024-11-20 02:07:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.3916083916083917) internal successors, (398), 286 states have internal predecessors, (398), 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-20 02:07:49,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 398 transitions. [2024-11-20 02:07:49,062 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 398 transitions. Word has length 80 [2024-11-20 02:07:49,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:49,063 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 398 transitions. [2024-11-20 02:07:49,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 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-20 02:07:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 398 transitions. [2024-11-20 02:07:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-20 02:07:49,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:49,064 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:49,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 02:07:49,064 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:49,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:49,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1169245647, now seen corresponding path program 1 times [2024-11-20 02:07:49,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:49,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875184380] [2024-11-20 02:07:49,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:49,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:49,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:49,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875184380] [2024-11-20 02:07:49,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875184380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:49,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:49,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-20 02:07:49,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915928072] [2024-11-20 02:07:49,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:49,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 02:07:49,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:49,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 02:07:49,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-11-20 02:07:49,892 INFO L87 Difference]: Start difference. First operand 287 states and 398 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 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-20 02:07:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:50,312 INFO L93 Difference]: Finished difference Result 530 states and 744 transitions. [2024-11-20 02:07:50,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 02:07:50,313 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 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 81 [2024-11-20 02:07:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:50,314 INFO L225 Difference]: With dead ends: 530 [2024-11-20 02:07:50,314 INFO L226 Difference]: Without dead ends: 352 [2024-11-20 02:07:50,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2024-11-20 02:07:50,315 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 158 mSDsluCounter, 1995 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:50,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 2139 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 02:07:50,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-20 02:07:50,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 329. [2024-11-20 02:07:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.4024390243902438) internal successors, (460), 328 states have internal predecessors, (460), 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-20 02:07:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 460 transitions. [2024-11-20 02:07:50,321 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 460 transitions. Word has length 81 [2024-11-20 02:07:50,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:50,321 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 460 transitions. [2024-11-20 02:07:50,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 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-20 02:07:50,321 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 460 transitions. [2024-11-20 02:07:50,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-20 02:07:50,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:50,322 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:50,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 02:07:50,322 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:50,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:50,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1118774572, now seen corresponding path program 1 times [2024-11-20 02:07:50,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:50,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358113215] [2024-11-20 02:07:50,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:50,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:50,790 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:50,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:50,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358113215] [2024-11-20 02:07:50,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358113215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:07:50,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665871553] [2024-11-20 02:07:50,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:50,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:07:50,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:07:50,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:07:50,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 02:07:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:50,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-20 02:07:50,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:07:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:51,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:07:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:51,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665871553] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 02:07:51,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-20 02:07:51,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [12, 16] total 37 [2024-11-20 02:07:51,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534012943] [2024-11-20 02:07:51,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:51,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 02:07:51,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:51,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 02:07:51,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1224, Unknown=0, NotChecked=0, Total=1332 [2024-11-20 02:07:51,777 INFO L87 Difference]: Start difference. First operand 329 states and 460 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 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-20 02:07:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:52,093 INFO L93 Difference]: Finished difference Result 564 states and 792 transitions. [2024-11-20 02:07:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 02:07:52,094 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 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 81 [2024-11-20 02:07:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:52,095 INFO L225 Difference]: With dead ends: 564 [2024-11-20 02:07:52,095 INFO L226 Difference]: Without dead ends: 385 [2024-11-20 02:07:52,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=1588, Unknown=0, NotChecked=0, Total=1722 [2024-11-20 02:07:52,096 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 59 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:52,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1513 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:07:52,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-20 02:07:52,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 365. [2024-11-20 02:07:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.4065934065934067) internal successors, (512), 364 states have internal predecessors, (512), 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-20 02:07:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 512 transitions. [2024-11-20 02:07:52,103 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 512 transitions. Word has length 81 [2024-11-20 02:07:52,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:52,104 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 512 transitions. [2024-11-20 02:07:52,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 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-20 02:07:52,104 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 512 transitions. [2024-11-20 02:07:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-20 02:07:52,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:52,105 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:52,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 02:07:52,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-20 02:07:52,306 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:52,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:52,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1516768061, now seen corresponding path program 1 times [2024-11-20 02:07:52,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:52,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463625997] [2024-11-20 02:07:52,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:52,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:52,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:52,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463625997] [2024-11-20 02:07:52,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463625997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:52,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:52,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 02:07:52,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252760431] [2024-11-20 02:07:52,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:52,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 02:07:52,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:52,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 02:07:52,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-20 02:07:52,736 INFO L87 Difference]: Start difference. First operand 365 states and 512 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 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-20 02:07:53,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:53,055 INFO L93 Difference]: Finished difference Result 677 states and 954 transitions. [2024-11-20 02:07:53,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 02:07:53,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 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 81 [2024-11-20 02:07:53,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:53,057 INFO L225 Difference]: With dead ends: 677 [2024-11-20 02:07:53,058 INFO L226 Difference]: Without dead ends: 472 [2024-11-20 02:07:53,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-20 02:07:53,058 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 132 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:53,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 2077 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:07:53,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-20 02:07:53,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 384. [2024-11-20 02:07:53,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 1.4073107049608355) internal successors, (539), 383 states have internal predecessors, (539), 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-20 02:07:53,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 539 transitions. [2024-11-20 02:07:53,066 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 539 transitions. Word has length 81 [2024-11-20 02:07:53,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:53,066 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 539 transitions. [2024-11-20 02:07:53,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 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-20 02:07:53,067 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 539 transitions. [2024-11-20 02:07:53,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-20 02:07:53,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:53,068 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:53,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 02:07:53,068 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:53,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:53,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1661938180, now seen corresponding path program 1 times [2024-11-20 02:07:53,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:53,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075968108] [2024-11-20 02:07:53,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:53,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:53,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:53,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075968108] [2024-11-20 02:07:53,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075968108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:53,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:53,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 02:07:53,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143833983] [2024-11-20 02:07:53,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:53,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 02:07:53,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:53,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 02:07:53,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-20 02:07:53,663 INFO L87 Difference]: Start difference. First operand 384 states and 539 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 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-20 02:07:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:53,948 INFO L93 Difference]: Finished difference Result 967 states and 1369 transitions. [2024-11-20 02:07:53,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 02:07:53,948 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 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 81 [2024-11-20 02:07:53,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:53,952 INFO L225 Difference]: With dead ends: 967 [2024-11-20 02:07:53,952 INFO L226 Difference]: Without dead ends: 743 [2024-11-20 02:07:53,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2024-11-20 02:07:53,953 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 152 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 2413 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:53,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 2413 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:07:53,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2024-11-20 02:07:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 620. [2024-11-20 02:07:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4022617124394183) internal successors, (868), 619 states have internal predecessors, (868), 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-20 02:07:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 868 transitions. [2024-11-20 02:07:53,969 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 868 transitions. Word has length 81 [2024-11-20 02:07:53,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:53,969 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 868 transitions. [2024-11-20 02:07:53,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 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-20 02:07:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 868 transitions. [2024-11-20 02:07:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-20 02:07:53,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:53,971 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:53,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 02:07:53,971 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:53,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:53,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1776829672, now seen corresponding path program 1 times [2024-11-20 02:07:53,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:53,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012036231] [2024-11-20 02:07:53,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:53,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:54,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:54,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012036231] [2024-11-20 02:07:54,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012036231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:54,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:54,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 02:07:54,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797248326] [2024-11-20 02:07:54,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:54,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 02:07:54,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:54,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 02:07:54,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:07:54,433 INFO L87 Difference]: Start difference. First operand 620 states and 868 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-20 02:07:54,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:54,556 INFO L93 Difference]: Finished difference Result 1129 states and 1589 transitions. [2024-11-20 02:07:54,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 02:07:54,557 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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 81 [2024-11-20 02:07:54,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:54,559 INFO L225 Difference]: With dead ends: 1129 [2024-11-20 02:07:54,559 INFO L226 Difference]: Without dead ends: 652 [2024-11-20 02:07:54,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-20 02:07:54,560 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 81 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:54,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1310 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:07:54,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-20 02:07:54,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 648. [2024-11-20 02:07:54,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 647 states have (on average 1.3848531684698608) internal successors, (896), 647 states have internal predecessors, (896), 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-20 02:07:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 896 transitions. [2024-11-20 02:07:54,571 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 896 transitions. Word has length 81 [2024-11-20 02:07:54,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:54,571 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 896 transitions. [2024-11-20 02:07:54,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-20 02:07:54,572 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 896 transitions. [2024-11-20 02:07:54,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-20 02:07:54,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:54,573 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:54,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 02:07:54,573 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:54,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:54,574 INFO L85 PathProgramCache]: Analyzing trace with hash -66857656, now seen corresponding path program 1 times [2024-11-20 02:07:54,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:54,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609726047] [2024-11-20 02:07:54,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:54,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:54,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:54,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609726047] [2024-11-20 02:07:54,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609726047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:54,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:54,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:07:54,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102975101] [2024-11-20 02:07:54,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:54,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:07:54,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:54,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:07:54,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:07:54,724 INFO L87 Difference]: Start difference. First operand 648 states and 896 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-20 02:07:54,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:54,748 INFO L93 Difference]: Finished difference Result 1067 states and 1487 transitions. [2024-11-20 02:07:54,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:07:54,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2024-11-20 02:07:54,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:54,750 INFO L225 Difference]: With dead ends: 1067 [2024-11-20 02:07:54,751 INFO L226 Difference]: Without dead ends: 638 [2024-11-20 02:07:54,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:07:54,752 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 51 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:54,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 621 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:07:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-20 02:07:54,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2024-11-20 02:07:54,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 637 states have (on average 1.3720565149136579) internal successors, (874), 637 states have internal predecessors, (874), 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-20 02:07:54,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 874 transitions. [2024-11-20 02:07:54,767 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 874 transitions. Word has length 81 [2024-11-20 02:07:54,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:54,767 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 874 transitions. [2024-11-20 02:07:54,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-20 02:07:54,768 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 874 transitions. [2024-11-20 02:07:54,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-20 02:07:54,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:54,769 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:54,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 02:07:54,769 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:54,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:54,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1970933155, now seen corresponding path program 1 times [2024-11-20 02:07:54,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:54,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137299451] [2024-11-20 02:07:54,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:54,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:54,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:54,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137299451] [2024-11-20 02:07:54,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137299451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:07:54,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:07:54,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:07:54,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301436862] [2024-11-20 02:07:54,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:07:54,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:07:54,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:54,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:07:54,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:07:54,914 INFO L87 Difference]: Start difference. First operand 638 states and 874 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-20 02:07:54,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:07:54,946 INFO L93 Difference]: Finished difference Result 1111 states and 1530 transitions. [2024-11-20 02:07:54,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:07:54,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2024-11-20 02:07:54,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:07:54,949 INFO L225 Difference]: With dead ends: 1111 [2024-11-20 02:07:54,949 INFO L226 Difference]: Without dead ends: 636 [2024-11-20 02:07:54,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:07:54,950 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 57 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:07:54,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 609 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:07:54,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-20 02:07:54,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2024-11-20 02:07:54,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.368503937007874) internal successors, (869), 635 states have internal predecessors, (869), 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-20 02:07:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 869 transitions. [2024-11-20 02:07:54,959 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 869 transitions. Word has length 81 [2024-11-20 02:07:54,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:07:54,959 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 869 transitions. [2024-11-20 02:07:54,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-20 02:07:54,959 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 869 transitions. [2024-11-20 02:07:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-20 02:07:54,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:07:54,960 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:07:54,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 02:07:54,961 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:07:54,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:07:54,961 INFO L85 PathProgramCache]: Analyzing trace with hash 94516038, now seen corresponding path program 1 times [2024-11-20 02:07:54,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:07:54,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010983786] [2024-11-20 02:07:54,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:54,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:07:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:55,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:07:55,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010983786] [2024-11-20 02:07:55,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010983786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:07:55,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623612751] [2024-11-20 02:07:55,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:07:55,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:07:55,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:07:55,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:07:55,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 02:07:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:07:55,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-20 02:07:55,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:07:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:56,788 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:07:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:07:58,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623612751] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 02:07:58,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 02:07:58,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 30, 29] total 68 [2024-11-20 02:07:58,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997470944] [2024-11-20 02:07:58,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 02:07:58,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-20 02:07:58,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:07:58,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-20 02:07:58,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=3778, Unknown=0, NotChecked=0, Total=4556 [2024-11-20 02:07:58,533 INFO L87 Difference]: Start difference. First operand 636 states and 869 transitions. Second operand has 68 states, 68 states have (on average 3.3676470588235294) internal successors, (229), 68 states have internal predecessors, (229), 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-20 02:08:01,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:08:01,434 INFO L93 Difference]: Finished difference Result 1436 states and 1999 transitions. [2024-11-20 02:08:01,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-20 02:08:01,435 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 3.3676470588235294) internal successors, (229), 68 states have internal predecessors, (229), 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 82 [2024-11-20 02:08:01,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:08:01,439 INFO L225 Difference]: With dead ends: 1436 [2024-11-20 02:08:01,439 INFO L226 Difference]: Without dead ends: 1065 [2024-11-20 02:08:01,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4069 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2014, Invalid=11792, Unknown=0, NotChecked=0, Total=13806 [2024-11-20 02:08:01,445 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1064 mSDsluCounter, 4090 mSDsCounter, 0 mSdLazyCounter, 2101 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 4211 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:08:01,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 4211 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2101 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 02:08:01,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-11-20 02:08:01,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 819. [2024-11-20 02:08:01,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 818 states have (on average 1.385085574572127) internal successors, (1133), 818 states have internal predecessors, (1133), 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-20 02:08:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1133 transitions. [2024-11-20 02:08:01,457 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1133 transitions. Word has length 82 [2024-11-20 02:08:01,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:08:01,457 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1133 transitions. [2024-11-20 02:08:01,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 3.3676470588235294) internal successors, (229), 68 states have internal predecessors, (229), 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-20 02:08:01,458 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1133 transitions. [2024-11-20 02:08:01,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-20 02:08:01,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:08:01,460 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:08:01,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 02:08:01,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-20 02:08:01,661 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:08:01,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:08:01,662 INFO L85 PathProgramCache]: Analyzing trace with hash 765481122, now seen corresponding path program 1 times [2024-11-20 02:08:01,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:08:01,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774060672] [2024-11-20 02:08:01,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:08:01,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:08:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:08:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:08:02,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:08:02,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774060672] [2024-11-20 02:08:02,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774060672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:08:02,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201117601] [2024-11-20 02:08:02,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:08:02,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:08:02,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:08:02,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:08:02,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 02:08:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:08:02,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-20 02:08:02,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:08:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:08:02,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:08:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:08:03,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201117601] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 02:08:03,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 02:08:03,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 17] total 38 [2024-11-20 02:08:03,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491680688] [2024-11-20 02:08:03,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 02:08:03,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-20 02:08:03,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:08:03,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-20 02:08:03,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2024-11-20 02:08:03,237 INFO L87 Difference]: Start difference. First operand 819 states and 1133 transitions. Second operand has 38 states, 38 states have (on average 4.552631578947368) internal successors, (173), 38 states have internal predecessors, (173), 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-20 02:08:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:08:04,032 INFO L93 Difference]: Finished difference Result 2425 states and 3368 transitions. [2024-11-20 02:08:04,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-20 02:08:04,033 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.552631578947368) internal successors, (173), 38 states have internal predecessors, (173), 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 82 [2024-11-20 02:08:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:08:04,037 INFO L225 Difference]: With dead ends: 2425 [2024-11-20 02:08:04,037 INFO L226 Difference]: Without dead ends: 1645 [2024-11-20 02:08:04,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 135 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=423, Invalid=3359, Unknown=0, NotChecked=0, Total=3782 [2024-11-20 02:08:04,060 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 524 mSDsluCounter, 2948 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 3087 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 02:08:04,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 3087 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 02:08:04,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2024-11-20 02:08:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1564. [2024-11-20 02:08:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1563 states have (on average 1.3742802303262955) internal successors, (2148), 1563 states have internal predecessors, (2148), 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-20 02:08:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2148 transitions. [2024-11-20 02:08:04,087 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2148 transitions. Word has length 82 [2024-11-20 02:08:04,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:08:04,087 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2148 transitions. [2024-11-20 02:08:04,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.552631578947368) internal successors, (173), 38 states have internal predecessors, (173), 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-20 02:08:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2148 transitions. [2024-11-20 02:08:04,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-20 02:08:04,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:08:04,090 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:08:04,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 02:08:04,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:08:04,291 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:08:04,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:08:04,291 INFO L85 PathProgramCache]: Analyzing trace with hash -6288752, now seen corresponding path program 1 times [2024-11-20 02:08:04,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:08:04,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963372790] [2024-11-20 02:08:04,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:08:04,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:08:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:08:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:08:04,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:08:04,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963372790] [2024-11-20 02:08:04,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963372790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:08:04,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:08:04,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 02:08:04,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415631189] [2024-11-20 02:08:04,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:08:04,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 02:08:04,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:08:04,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 02:08:04,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-20 02:08:04,933 INFO L87 Difference]: Start difference. First operand 1564 states and 2148 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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-20 02:08:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:08:05,227 INFO L93 Difference]: Finished difference Result 2711 states and 3753 transitions. [2024-11-20 02:08:05,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 02:08:05,227 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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 82 [2024-11-20 02:08:05,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:08:05,231 INFO L225 Difference]: With dead ends: 2711 [2024-11-20 02:08:05,231 INFO L226 Difference]: Without dead ends: 1596 [2024-11-20 02:08:05,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2024-11-20 02:08:05,232 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 124 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:08:05,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1849 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:08:05,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2024-11-20 02:08:05,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1568. [2024-11-20 02:08:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1567 states have (on average 1.3733248245054244) internal successors, (2152), 1567 states have internal predecessors, (2152), 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-20 02:08:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2152 transitions. [2024-11-20 02:08:05,252 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2152 transitions. Word has length 82 [2024-11-20 02:08:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:08:05,252 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2152 transitions. [2024-11-20 02:08:05,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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-20 02:08:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2152 transitions. [2024-11-20 02:08:05,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-20 02:08:05,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:08:05,254 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:08:05,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 02:08:05,254 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:08:05,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:08:05,255 INFO L85 PathProgramCache]: Analyzing trace with hash -231925111, now seen corresponding path program 1 times [2024-11-20 02:08:05,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:08:05,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067250796] [2024-11-20 02:08:05,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:08:05,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:08:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:08:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:08:06,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:08:06,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067250796] [2024-11-20 02:08:06,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067250796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:08:06,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:08:06,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 02:08:06,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561211725] [2024-11-20 02:08:06,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:08:06,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 02:08:06,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:08:06,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 02:08:06,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-20 02:08:06,036 INFO L87 Difference]: Start difference. First operand 1568 states and 2152 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 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-20 02:08:06,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:08:06,397 INFO L93 Difference]: Finished difference Result 2679 states and 3709 transitions. [2024-11-20 02:08:06,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 02:08:06,397 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 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 82 [2024-11-20 02:08:06,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:08:06,401 INFO L225 Difference]: With dead ends: 2679 [2024-11-20 02:08:06,401 INFO L226 Difference]: Without dead ends: 1600 [2024-11-20 02:08:06,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-20 02:08:06,402 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 98 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:08:06,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1830 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:08:06,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2024-11-20 02:08:06,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1572. [2024-11-20 02:08:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1571 states have (on average 1.372374283895608) internal successors, (2156), 1571 states have internal predecessors, (2156), 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-20 02:08:06,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2156 transitions. [2024-11-20 02:08:06,421 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2156 transitions. Word has length 82 [2024-11-20 02:08:06,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:08:06,421 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2156 transitions. [2024-11-20 02:08:06,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 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-20 02:08:06,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2156 transitions. [2024-11-20 02:08:06,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-20 02:08:06,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:08:06,423 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:08:06,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 02:08:06,423 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:08:06,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:08:06,424 INFO L85 PathProgramCache]: Analyzing trace with hash 861498717, now seen corresponding path program 1 times [2024-11-20 02:08:06,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:08:06,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545154782] [2024-11-20 02:08:06,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:08:06,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:08:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:08:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:08:06,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:08:06,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545154782] [2024-11-20 02:08:06,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545154782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:08:06,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:08:06,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:08:06,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619040452] [2024-11-20 02:08:06,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:08:06,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:08:06,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:08:06,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:08:06,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:08:06,587 INFO L87 Difference]: Start difference. First operand 1572 states and 2156 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-20 02:08:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:08:06,626 INFO L93 Difference]: Finished difference Result 2651 states and 3669 transitions. [2024-11-20 02:08:06,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:08:06,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 82 [2024-11-20 02:08:06,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:08:06,629 INFO L225 Difference]: With dead ends: 2651 [2024-11-20 02:08:06,630 INFO L226 Difference]: Without dead ends: 1358 [2024-11-20 02:08:06,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:08:06,631 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 53 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:08:06,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 610 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:08:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2024-11-20 02:08:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1358. [2024-11-20 02:08:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1357 states have (on average 1.3809874723655122) internal successors, (1874), 1357 states have internal predecessors, (1874), 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-20 02:08:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1874 transitions. [2024-11-20 02:08:06,654 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1874 transitions. Word has length 82 [2024-11-20 02:08:06,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:08:06,655 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1874 transitions. [2024-11-20 02:08:06,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-20 02:08:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1874 transitions. [2024-11-20 02:08:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-20 02:08:06,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:08:06,656 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:08:06,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 02:08:06,657 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:08:06,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:08:06,657 INFO L85 PathProgramCache]: Analyzing trace with hash 199575100, now seen corresponding path program 1 times [2024-11-20 02:08:06,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:08:06,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540082027] [2024-11-20 02:08:06,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:08:06,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:08:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:08:06,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:08:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:08:06,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:08:06,850 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:08:06,851 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:08:06,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-20 02:08:06,854 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, 1, 1, 1, 1, 1] [2024-11-20 02:08:06,909 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:08:06,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:08:06 BoogieIcfgContainer [2024-11-20 02:08:06,912 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:08:06,913 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:08:06,913 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:08:06,913 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:08:06,913 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:07:43" (3/4) ... [2024-11-20 02:08:06,915 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:08:06,916 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:08:06,916 INFO L158 Benchmark]: Toolchain (without parser) took 25137.65ms. Allocated memory was 169.9MB in the beginning and 750.8MB in the end (delta: 580.9MB). Free memory was 101.4MB in the beginning and 579.2MB in the end (delta: -477.8MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. [2024-11-20 02:08:06,917 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:08:06,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.72ms. Allocated memory is still 169.9MB. Free memory was 101.2MB in the beginning and 133.0MB in the end (delta: -31.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 02:08:06,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.27ms. Allocated memory is still 169.9MB. Free memory was 133.0MB in the beginning and 122.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 02:08:06,918 INFO L158 Benchmark]: Boogie Preprocessor took 114.55ms. Allocated memory is still 169.9MB. Free memory was 122.5MB in the beginning and 116.9MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 02:08:06,918 INFO L158 Benchmark]: RCFGBuilder took 665.00ms. Allocated memory is still 169.9MB. Free memory was 116.9MB in the beginning and 61.6MB in the end (delta: 55.3MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-20 02:08:06,918 INFO L158 Benchmark]: TraceAbstraction took 23856.53ms. Allocated memory was 169.9MB in the beginning and 750.8MB in the end (delta: 580.9MB). Free memory was 60.9MB in the beginning and 579.2MB in the end (delta: -518.2MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2024-11-20 02:08:06,918 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 750.8MB. Free memory is still 579.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:08:06,919 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.17ms. Allocated memory is still 104.9MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.72ms. Allocated memory is still 169.9MB. Free memory was 101.2MB in the beginning and 133.0MB in the end (delta: -31.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.27ms. Allocated memory is still 169.9MB. Free memory was 133.0MB in the beginning and 122.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.55ms. Allocated memory is still 169.9MB. Free memory was 122.5MB in the beginning and 116.9MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 665.00ms. Allocated memory is still 169.9MB. Free memory was 116.9MB in the beginning and 61.6MB in the end (delta: 55.3MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23856.53ms. Allocated memory was 169.9MB in the beginning and 750.8MB in the end (delta: 580.9MB). Free memory was 60.9MB in the beginning and 579.2MB in the end (delta: -518.2MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 750.8MB. Free memory is still 579.2MB. 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 106, overapproximation of bitwiseAnd at line 111. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1); [L35] const SORT_3 var_14 = 0; [L36] const SORT_3 var_29 = 1; [L38] SORT_1 input_2; [L39] SORT_3 input_4; [L40] SORT_3 input_5; [L41] SORT_3 input_6; [L42] SORT_3 input_7; [L43] SORT_3 input_8; [L44] SORT_3 input_9; [L45] SORT_3 input_10; [L46] SORT_3 input_11; [L47] SORT_12 input_13; [L48] SORT_12 input_33; [L49] SORT_12 input_35; [L50] SORT_3 input_37; [L51] SORT_3 input_39; [L52] SORT_12 input_97; [L53] SORT_3 input_99; [L54] SORT_1 input_102; [L55] SORT_3 input_104; [L56] SORT_3 input_106; [L57] SORT_3 input_108; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L59] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L60] SORT_3 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L61] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L62] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L64] SORT_3 init_16_arg_1 = var_14; [L65] state_15 = init_16_arg_1 [L66] SORT_3 init_18_arg_1 = var_14; [L67] state_17 = init_18_arg_1 [L68] SORT_3 init_21_arg_1 = var_14; [L69] state_20 = init_21_arg_1 [L70] SORT_3 init_25_arg_1 = var_14; [L71] state_24 = init_25_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_19_arg_0=0, var_19_arg_1=0, var_29=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_22_arg_0=0, var_22_arg_1=0, var_29=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_26_arg_0=-1, var_26_arg_1=0, var_29=1] [L106] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-256] [L111] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] EXPR var_31 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND FALSE !(!(cond)) [L114] RET __VERIFIER_assert(!(bad_32_arg_0)) [L116] SORT_3 var_41_arg_0 = state_17; [L117] SORT_3 var_41 = ~var_41_arg_0; [L118] SORT_3 var_42_arg_0 = state_15; [L119] SORT_3 var_42 = ~var_42_arg_0; [L120] SORT_3 var_43_arg_0 = var_42; [L121] SORT_3 var_43_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_41=-1, var_42=-1, var_43_arg_0=-1, var_43_arg_1=0] [L122] EXPR var_43_arg_0 & var_43_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_41=-1, var_42=-1] [L122] SORT_3 var_43 = var_43_arg_0 & var_43_arg_1; [L123] SORT_3 var_44_arg_0 = var_43; [L124] SORT_3 var_44 = ~var_44_arg_0; [L125] SORT_3 var_45_arg_0 = var_41; [L126] SORT_3 var_45_arg_1 = var_44; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_45_arg_0=-1, var_45_arg_1=-1] [L127] EXPR var_45_arg_0 | var_45_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1] [L127] SORT_3 var_45 = var_45_arg_0 | var_45_arg_1; [L128] SORT_3 var_46_arg_0 = var_45; [L129] SORT_3 var_46 = ~var_46_arg_0; [L130] SORT_3 var_47_arg_0 = state_17; [L131] SORT_3 var_47_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_46=-256, var_47_arg_0=0, var_47_arg_1=0] [L132] EXPR var_47_arg_0 & var_47_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_46=-256] [L132] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L133] SORT_3 var_48_arg_0 = var_42; [L134] SORT_3 var_48_arg_1 = var_47; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_46=-256, var_48_arg_0=-1, var_48_arg_1=0] [L135] EXPR var_48_arg_0 | var_48_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_46=-256] [L135] SORT_3 var_48 = var_48_arg_0 | var_48_arg_1; [L136] SORT_3 var_49_arg_0 = var_48; [L137] SORT_3 var_49 = ~var_49_arg_0; [L138] SORT_3 var_50_arg_0 = var_46; [L139] SORT_3 var_50_arg_1 = var_49; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_50_arg_0=-256, var_50_arg_1=-256] [L140] EXPR var_50_arg_0 | var_50_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L140] SORT_3 var_50 = var_50_arg_0 | var_50_arg_1; [L141] SORT_3 next_110_arg_1 = var_50; [L142] SORT_3 var_52_arg_0 = state_20; [L143] SORT_3 var_52 = ~var_52_arg_0; [L144] SORT_3 var_53_arg_0 = state_17; [L145] SORT_3 var_53_arg_1 = var_52; VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53_arg_0=0, var_53_arg_1=-1] [L146] EXPR var_53_arg_0 | var_53_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1] [L146] SORT_3 var_53 = var_53_arg_0 | var_53_arg_1; [L147] SORT_3 var_54_arg_0 = state_17; [L148] SORT_3 var_54_arg_1 = var_52; VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53=255, var_54_arg_0=0, var_54_arg_1=-1] [L149] EXPR var_54_arg_0 & var_54_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53=255] [L149] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L150] SORT_3 var_55_arg_0 = var_54; [L151] SORT_3 var_55 = ~var_55_arg_0; [L152] SORT_3 var_56_arg_0 = var_53; [L153] SORT_3 var_56_arg_1 = var_55; VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_56_arg_0=255, var_56_arg_1=-1] [L154] EXPR var_56_arg_0 & var_56_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1] [L154] SORT_3 var_56 = var_56_arg_0 & var_56_arg_1; [L155] SORT_3 var_57_arg_0 = var_56; [L156] SORT_3 var_57 = ~var_57_arg_0; [L157] SORT_3 next_111_arg_1 = var_57; [L158] SORT_1 var_59_arg_0 = input_2; [L159] SORT_3 var_59 = var_59_arg_0 >> 0; [L160] SORT_1 var_60_arg_0 = input_2; [L161] SORT_3 var_60 = var_60_arg_0 >> 2; [L162] SORT_3 var_61_arg_0 = var_60; [L163] SORT_3 var_61 = ~var_61_arg_0; [L164] SORT_1 var_62_arg_0 = input_2; [L165] SORT_3 var_62 = var_62_arg_0 >> 1; [L166] SORT_3 var_63_arg_0 = var_61; [L167] SORT_3 var_63_arg_1 = var_62; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63_arg_0=-1, var_63_arg_1=0] [L168] EXPR var_63_arg_0 | var_63_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0] [L168] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L169] SORT_3 var_64_arg_0 = var_59; [L170] SORT_3 var_64_arg_1 = var_63; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_64_arg_0=0, var_64_arg_1=255] [L171] EXPR var_64_arg_0 | var_64_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255] [L171] SORT_3 var_64 = var_64_arg_0 | var_64_arg_1; [L172] SORT_3 var_65_arg_0 = var_64; [L173] SORT_3 var_65 = ~var_65_arg_0; [L174] SORT_3 var_66_arg_0 = state_15; [L175] SORT_3 var_66_arg_1 = state_17; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_65=-256, var_66_arg_0=0, var_66_arg_1=0] [L176] EXPR var_66_arg_0 | var_66_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_65=-256] [L176] SORT_3 var_66 = var_66_arg_0 | var_66_arg_1; [L177] SORT_3 var_67_arg_0 = var_65; [L178] SORT_3 var_67_arg_1 = var_66; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_66=0, var_67_arg_0=-256, var_67_arg_1=0] [L179] EXPR var_67_arg_0 | var_67_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_66=0] [L179] SORT_3 var_67 = var_67_arg_0 | var_67_arg_1; [L180] SORT_3 var_68_arg_0 = var_67; [L181] SORT_3 var_68_arg_1 = var_52; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_59=0, var_63=255, var_66=0, var_68_arg_0=0, var_68_arg_1=-1] [L182] EXPR var_68_arg_0 & var_68_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_59=0, var_63=255, var_66=0] [L182] SORT_3 var_68 = var_68_arg_0 & var_68_arg_1; [L183] SORT_3 next_112_arg_1 = var_68; [L184] SORT_3 var_75_arg_0 = state_20; [L185] SORT_3 var_75_arg_1 = var_66; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_59=0, var_63=255, var_75_arg_0=0, var_75_arg_1=0] [L186] EXPR var_75_arg_0 | var_75_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_59=0, var_63=255] [L186] SORT_3 var_75 = var_75_arg_0 | var_75_arg_1; [L187] SORT_3 var_76_arg_0 = var_75; [L188] SORT_3 var_76 = ~var_76_arg_0; [L189] SORT_3 var_77_arg_0 = var_59; [L190] SORT_3 var_77_arg_1 = var_76; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_63=255, var_76=-1, var_77_arg_0=0, var_77_arg_1=-1] [L191] EXPR var_77_arg_0 & var_77_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_63=255, var_76=-1] [L191] SORT_3 var_77 = var_77_arg_0 & var_77_arg_1; [L192] SORT_3 var_78_arg_0 = var_77; [L193] SORT_3 var_78 = ~var_78_arg_0; [L194] SORT_3 var_82_arg_0 = var_63; [L195] SORT_3 var_82_arg_1 = var_76; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_78=-1, var_82_arg_0=255, var_82_arg_1=-1] [L196] EXPR var_82_arg_0 & var_82_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_78=-1] [L196] SORT_3 var_82 = var_82_arg_0 & var_82_arg_1; [L197] SORT_3 var_91_arg_0 = var_82; [L198] SORT_3 var_91 = ~var_91_arg_0; [L199] SORT_3 var_92_arg_0 = var_78; [L200] SORT_3 var_92_arg_1 = var_91; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_92_arg_0=-1, var_92_arg_1=-256] [L201] EXPR var_92_arg_0 & var_92_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1] [L201] SORT_3 var_92 = var_92_arg_0 & var_92_arg_1; [L202] SORT_3 var_94_arg_0 = input_4; [L203] SORT_3 var_94_arg_1 = var_92; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_94_arg_0=254, var_94_arg_1=0] [L204] EXPR var_94_arg_0 | var_94_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1] [L204] SORT_3 var_94 = var_94_arg_0 | var_94_arg_1; [L205] SORT_3 var_95_arg_0 = var_94; [L206] SORT_3 var_95 = ~var_95_arg_0; [L207] SORT_3 next_113_arg_1 = var_95; [L209] state_15 = next_110_arg_1 [L210] state_17 = next_111_arg_1 [L211] state_20 = next_112_arg_1 [L212] state_24 = next_113_arg_1 [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-255, var_19_arg_0=0, var_19_arg_1=-256, var_29=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-255, var_29=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-255, var_22_arg_0=0, var_22_arg_1=0, var_29=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-255, var_29=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_26_arg_0=-1, var_26_arg_1=-255, var_29=1] [L106] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-1] [L111] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] EXPR var_31 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.8s, OverallIterations: 27, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3264 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3264 mSDsluCounter, 36112 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31887 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6436 IncrementalHoareTripleChecker+Invalid, 6502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 4225 mSDtfsCounter, 6436 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 896 GetRequests, 449 SyntacticMatches, 4 SemanticMatches, 443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5873 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1572occurred in iteration=25, InterpolantAutomatonStates: 320, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 930 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 2079 NumberOfCodeBlocks, 2079 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2209 ConstructedInterpolants, 0 QuantifiedInterpolants, 10642 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1352 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 32 InterpolantComputations, 24 PerfectInterpolantSequences, 294/319 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 02:08:06,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 64bit --witnessprinter.graph.data.programhash cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:08:09,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:08:09,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-20 02:08:09,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:08:09,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:08:09,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:08:09,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:08:09,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:08:09,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:08:09,374 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:08:09,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:08:09,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:08:09,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:08:09,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:08:09,376 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:08:09,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:08:09,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:08:09,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:08:09,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:08:09,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:08:09,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:08:09,380 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:08:09,380 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:08:09,380 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:08:09,380 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:08:09,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:08:09,381 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:08:09,381 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:08:09,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:08:09,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:08:09,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:08:09,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:08:09,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:08:09,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:08:09,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:08:09,382 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:08:09,382 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:08:09,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:08:09,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:08:09,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:08:09,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:08:09,386 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d [2024-11-20 02:08:09,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:08:09,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:08:09,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:08:09,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:08:09,714 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:08:09,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-20 02:08:11,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:08:11,431 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:08:11,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-20 02:08:11,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/661ac3dcb/5c7c958a01044c99907a45b0a272f9fd/FLAG12840d6cb [2024-11-20 02:08:11,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/661ac3dcb/5c7c958a01044c99907a45b0a272f9fd [2024-11-20 02:08:11,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:08:11,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:08:11,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:08:11,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:08:11,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:08:11,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:08:11" (1/1) ... [2024-11-20 02:08:11,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a71cff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:08:11, skipping insertion in model container [2024-11-20 02:08:11,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:08:11" (1/1) ... [2024-11-20 02:08:11,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:08:11,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2024-11-20 02:08:11,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:08:11,747 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:08:11,757 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2024-11-20 02:08:11,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:08:11,832 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:08:11,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:08:11 WrapperNode [2024-11-20 02:08:11,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:08:11,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:08:11,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:08:11,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:08:11,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:08:11" (1/1) ... [2024-11-20 02:08:11,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:08:11" (1/1) ... [2024-11-20 02:08:11,889 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 242 [2024-11-20 02:08:11,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:08:11,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:08:11,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:08:11,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:08:11,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:08:11" (1/1) ... [2024-11-20 02:08:11,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:08:11" (1/1) ... [2024-11-20 02:08:11,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:08:11" (1/1) ... [2024-11-20 02:08:11,932 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-20 02:08:11,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:08:11" (1/1) ... [2024-11-20 02:08:11,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:08:11" (1/1) ... [2024-11-20 02:08:11,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:08:11" (1/1) ... [2024-11-20 02:08:11,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:08:11" (1/1) ... [2024-11-20 02:08:11,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:08:11" (1/1) ... [2024-11-20 02:08:11,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:08:11" (1/1) ... [2024-11-20 02:08:11,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:08:11,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:08:11,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:08:11,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:08:11,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:08:11" (1/1) ... [2024-11-20 02:08:11,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:08:11,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:08:11,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:08:12,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:08:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:08:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:08:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:08:12,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:08:12,123 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:08:12,125 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:08:12,289 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-20 02:08:12,290 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:08:12,298 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:08:12,298 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:08:12,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:08:12 BoogieIcfgContainer [2024-11-20 02:08:12,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:08:12,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:08:12,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:08:12,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:08:12,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:08:11" (1/3) ... [2024-11-20 02:08:12,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185964f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:08:12, skipping insertion in model container [2024-11-20 02:08:12,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:08:11" (2/3) ... [2024-11-20 02:08:12,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185964f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:08:12, skipping insertion in model container [2024-11-20 02:08:12,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:08:12" (3/3) ... [2024-11-20 02:08:12,306 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-20 02:08:12,334 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:08:12,334 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:08:12,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:08:12,385 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;@10dc7b8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:08:12,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:08:12,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-20 02:08:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 02:08:12,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:08:12,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 02:08:12,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:08:12,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:08:12,401 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-20 02:08:12,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:08:12,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672855457] [2024-11-20 02:08:12,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:08:12,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:08:12,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:08:12,416 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:08:12,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 02:08:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:08:12,597 WARN L253 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-20 02:08:12,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:08:12,820 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-20 02:08:12,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:08:12,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:08:12,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672855457] [2024-11-20 02:08:12,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672855457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:08:12,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:08:12,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:08:12,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152397961] [2024-11-20 02:08:12,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:08:12,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:08:12,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:08:12,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:08:12,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:08:12,848 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-20 02:08:12,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:08:12,888 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-20 02:08:12,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:08:12,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-20 02:08:12,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:08:12,896 INFO L225 Difference]: With dead ends: 18 [2024-11-20 02:08:12,896 INFO L226 Difference]: Without dead ends: 10 [2024-11-20 02:08:12,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:08:12,900 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:08:12,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:08:12,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-20 02:08:12,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-20 02:08:12,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-20 02:08:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-20 02:08:12,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-20 02:08:12,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:08:12,927 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-20 02:08:12,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-20 02:08:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-20 02:08:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 02:08:12,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:08:12,928 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-20 02:08:12,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 02:08:13,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:08:13,132 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:08:13,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:08:13,134 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-20 02:08:13,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:08:13,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99404159] [2024-11-20 02:08:13,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:08:13,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:08:13,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:08:13,139 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:08:13,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 02:08:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:08:13,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:08:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:08:13,323 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-20 02:08:13,324 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:08:13,326 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:08:13,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 02:08:13,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:08:13,533 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-20 02:08:13,564 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:08:13,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:08:13 BoogieIcfgContainer [2024-11-20 02:08:13,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:08:13,567 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:08:13,567 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:08:13,567 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:08:13,567 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:08:12" (3/4) ... [2024-11-20 02:08:13,568 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-20 02:08:13,616 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 02:08:13,616 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:08:13,617 INFO L158 Benchmark]: Toolchain (without parser) took 2152.30ms. Allocated memory was 88.1MB in the beginning and 123.7MB in the end (delta: 35.7MB). Free memory was 50.9MB in the beginning and 55.6MB in the end (delta: -4.7MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2024-11-20 02:08:13,617 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 88.1MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:08:13,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.02ms. Allocated memory is still 88.1MB. Free memory was 50.9MB in the beginning and 65.2MB in the end (delta: -14.4MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-20 02:08:13,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.62ms. Allocated memory is still 88.1MB. Free memory was 64.9MB in the beginning and 62.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 02:08:13,617 INFO L158 Benchmark]: Boogie Preprocessor took 72.65ms. Allocated memory is still 88.1MB. Free memory was 62.6MB in the beginning and 59.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 02:08:13,617 INFO L158 Benchmark]: RCFGBuilder took 332.81ms. Allocated memory is still 88.1MB. Free memory was 59.5MB in the beginning and 37.4MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 02:08:13,618 INFO L158 Benchmark]: TraceAbstraction took 1266.46ms. Allocated memory was 88.1MB in the beginning and 123.7MB in the end (delta: 35.7MB). Free memory was 36.7MB in the beginning and 59.8MB in the end (delta: -23.1MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-11-20 02:08:13,618 INFO L158 Benchmark]: Witness Printer took 49.55ms. Allocated memory is still 123.7MB. Free memory was 59.8MB in the beginning and 55.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 02:08:13,619 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.09ms. Allocated memory is still 88.1MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.02ms. Allocated memory is still 88.1MB. Free memory was 50.9MB in the beginning and 65.2MB in the end (delta: -14.4MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.62ms. Allocated memory is still 88.1MB. Free memory was 64.9MB in the beginning and 62.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.65ms. Allocated memory is still 88.1MB. Free memory was 62.6MB in the beginning and 59.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 332.81ms. Allocated memory is still 88.1MB. Free memory was 59.5MB in the beginning and 37.4MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1266.46ms. Allocated memory was 88.1MB in the beginning and 123.7MB in the end (delta: 35.7MB). Free memory was 36.7MB in the beginning and 59.8MB in the end (delta: -23.1MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * Witness Printer took 49.55ms. Allocated memory is still 123.7MB. Free memory was 59.8MB in the beginning and 55.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1); [L35] const SORT_3 var_14 = 0; [L36] const SORT_3 var_29 = 1; [L38] SORT_1 input_2; [L39] SORT_3 input_4; [L40] SORT_3 input_5; [L41] SORT_3 input_6; [L42] SORT_3 input_7; [L43] SORT_3 input_8; [L44] SORT_3 input_9; [L45] SORT_3 input_10; [L46] SORT_3 input_11; [L47] SORT_12 input_13; [L48] SORT_12 input_33; [L49] SORT_12 input_35; [L50] SORT_3 input_37; [L51] SORT_3 input_39; [L52] SORT_12 input_97; [L53] SORT_3 input_99; [L54] SORT_1 input_102; [L55] SORT_3 input_104; [L56] SORT_3 input_106; [L57] SORT_3 input_108; [L59] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L60] SORT_3 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L61] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L62] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L64] SORT_3 init_16_arg_1 = var_14; [L65] state_15 = init_16_arg_1 [L66] SORT_3 init_18_arg_1 = var_14; [L67] state_17 = init_18_arg_1 [L68] SORT_3 init_21_arg_1 = var_14; [L69] state_20 = init_21_arg_1 [L70] SORT_3 init_25_arg_1 = var_14; [L71] state_24 = init_25_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND FALSE !(!(cond)) [L114] RET __VERIFIER_assert(!(bad_32_arg_0)) [L116] SORT_3 var_41_arg_0 = state_17; [L117] SORT_3 var_41 = ~var_41_arg_0; [L118] SORT_3 var_42_arg_0 = state_15; [L119] SORT_3 var_42 = ~var_42_arg_0; [L120] SORT_3 var_43_arg_0 = var_42; [L121] SORT_3 var_43_arg_1 = state_20; [L122] SORT_3 var_43 = var_43_arg_0 & var_43_arg_1; [L123] SORT_3 var_44_arg_0 = var_43; [L124] SORT_3 var_44 = ~var_44_arg_0; [L125] SORT_3 var_45_arg_0 = var_41; [L126] SORT_3 var_45_arg_1 = var_44; [L127] SORT_3 var_45 = var_45_arg_0 | var_45_arg_1; [L128] SORT_3 var_46_arg_0 = var_45; [L129] SORT_3 var_46 = ~var_46_arg_0; [L130] SORT_3 var_47_arg_0 = state_17; [L131] SORT_3 var_47_arg_1 = state_20; [L132] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L133] SORT_3 var_48_arg_0 = var_42; [L134] SORT_3 var_48_arg_1 = var_47; [L135] SORT_3 var_48 = var_48_arg_0 | var_48_arg_1; [L136] SORT_3 var_49_arg_0 = var_48; [L137] SORT_3 var_49 = ~var_49_arg_0; [L138] SORT_3 var_50_arg_0 = var_46; [L139] SORT_3 var_50_arg_1 = var_49; [L140] SORT_3 var_50 = var_50_arg_0 | var_50_arg_1; [L141] SORT_3 next_110_arg_1 = var_50; [L142] SORT_3 var_52_arg_0 = state_20; [L143] SORT_3 var_52 = ~var_52_arg_0; [L144] SORT_3 var_53_arg_0 = state_17; [L145] SORT_3 var_53_arg_1 = var_52; [L146] SORT_3 var_53 = var_53_arg_0 | var_53_arg_1; [L147] SORT_3 var_54_arg_0 = state_17; [L148] SORT_3 var_54_arg_1 = var_52; [L149] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L150] SORT_3 var_55_arg_0 = var_54; [L151] SORT_3 var_55 = ~var_55_arg_0; [L152] SORT_3 var_56_arg_0 = var_53; [L153] SORT_3 var_56_arg_1 = var_55; [L154] SORT_3 var_56 = var_56_arg_0 & var_56_arg_1; [L155] SORT_3 var_57_arg_0 = var_56; [L156] SORT_3 var_57 = ~var_57_arg_0; [L157] SORT_3 next_111_arg_1 = var_57; [L158] SORT_1 var_59_arg_0 = input_2; [L159] SORT_3 var_59 = var_59_arg_0 >> 0; [L160] SORT_1 var_60_arg_0 = input_2; [L161] SORT_3 var_60 = var_60_arg_0 >> 2; [L162] SORT_3 var_61_arg_0 = var_60; [L163] SORT_3 var_61 = ~var_61_arg_0; [L164] SORT_1 var_62_arg_0 = input_2; [L165] SORT_3 var_62 = var_62_arg_0 >> 1; [L166] SORT_3 var_63_arg_0 = var_61; [L167] SORT_3 var_63_arg_1 = var_62; [L168] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L169] SORT_3 var_64_arg_0 = var_59; [L170] SORT_3 var_64_arg_1 = var_63; [L171] SORT_3 var_64 = var_64_arg_0 | var_64_arg_1; [L172] SORT_3 var_65_arg_0 = var_64; [L173] SORT_3 var_65 = ~var_65_arg_0; [L174] SORT_3 var_66_arg_0 = state_15; [L175] SORT_3 var_66_arg_1 = state_17; [L176] SORT_3 var_66 = var_66_arg_0 | var_66_arg_1; [L177] SORT_3 var_67_arg_0 = var_65; [L178] SORT_3 var_67_arg_1 = var_66; [L179] SORT_3 var_67 = var_67_arg_0 | var_67_arg_1; [L180] SORT_3 var_68_arg_0 = var_67; [L181] SORT_3 var_68_arg_1 = var_52; [L182] SORT_3 var_68 = var_68_arg_0 & var_68_arg_1; [L183] SORT_3 next_112_arg_1 = var_68; [L184] SORT_3 var_75_arg_0 = state_20; [L185] SORT_3 var_75_arg_1 = var_66; [L186] SORT_3 var_75 = var_75_arg_0 | var_75_arg_1; [L187] SORT_3 var_76_arg_0 = var_75; [L188] SORT_3 var_76 = ~var_76_arg_0; [L189] SORT_3 var_77_arg_0 = var_59; [L190] SORT_3 var_77_arg_1 = var_76; [L191] SORT_3 var_77 = var_77_arg_0 & var_77_arg_1; [L192] SORT_3 var_78_arg_0 = var_77; [L193] SORT_3 var_78 = ~var_78_arg_0; [L194] SORT_3 var_82_arg_0 = var_63; [L195] SORT_3 var_82_arg_1 = var_76; [L196] SORT_3 var_82 = var_82_arg_0 & var_82_arg_1; [L197] SORT_3 var_91_arg_0 = var_82; [L198] SORT_3 var_91 = ~var_91_arg_0; [L199] SORT_3 var_92_arg_0 = var_78; [L200] SORT_3 var_92_arg_1 = var_91; [L201] SORT_3 var_92 = var_92_arg_0 & var_92_arg_1; [L202] SORT_3 var_94_arg_0 = input_4; [L203] SORT_3 var_94_arg_1 = var_92; [L204] SORT_3 var_94 = var_94_arg_0 | var_94_arg_1; [L205] SORT_3 var_95_arg_0 = var_94; [L206] SORT_3 var_95 = ~var_95_arg_0; [L207] SORT_3 next_113_arg_1 = var_95; [L209] state_15 = next_110_arg_1 [L210] state_17 = next_111_arg_1 [L211] state_20 = next_112_arg_1 [L212] state_24 = next_113_arg_1 [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 4 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 4 NumberOfNonLiveVariables, 49 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-20 02:08:13,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE