./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_arrays_vsaR_p12.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d570de8a468b2e5d7e18a67170da2d8f06202ccdf10baa0799e3c0763140866e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:04:18,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:04:18,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 07:04:18,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:04:18,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:04:18,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:04:18,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:04:18,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:04:18,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:04:18,467 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:04:18,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:04:18,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:04:18,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:04:18,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:04:18,471 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:04:18,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:04:18,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:04:18,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:04:18,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:04:18,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:04:18,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:04:18,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:04:18,475 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:04:18,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:04:18,476 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:04:18,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:04:18,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:04:18,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:04:18,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:04:18,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:04:18,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:04:18,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:04:18,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:04:18,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:04:18,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:04:18,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:04:18,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:04:18,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:04:18,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:04:18,480 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-clean/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-clean/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 -> d570de8a468b2e5d7e18a67170da2d8f06202ccdf10baa0799e3c0763140866e [2024-10-11 07:04:18,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:04:18,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:04:18,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:04:18,771 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:04:18,771 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:04:18,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c [2024-10-11 07:04:20,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:04:20,486 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:04:20,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c [2024-10-11 07:04:20,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a8c5d898f/acb7388b82a84d93942e07810ab702cd/FLAG6d53023c4 [2024-10-11 07:04:20,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a8c5d898f/acb7388b82a84d93942e07810ab702cd [2024-10-11 07:04:20,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:04:20,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:04:20,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:04:20,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:04:20,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:04:20,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:04:20" (1/1) ... [2024-10-11 07:04:20,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a521f6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:20, skipping insertion in model container [2024-10-11 07:04:20,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:04:20" (1/1) ... [2024-10-11 07:04:20,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:04:20,782 WARN L248 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_arrays_vsaR_p12.c[1259,1272] [2024-10-11 07:04:21,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:04:21,063 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:04:21,074 WARN L248 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_arrays_vsaR_p12.c[1259,1272] [2024-10-11 07:04:21,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:04:21,250 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:04:21,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:21 WrapperNode [2024-10-11 07:04:21,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:04:21,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:04:21,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:04:21,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:04:21,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:21" (1/1) ... [2024-10-11 07:04:21,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:21" (1/1) ... [2024-10-11 07:04:21,542 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2239 [2024-10-11 07:04:21,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:04:21,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:04:21,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:04:21,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:04:21,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:21" (1/1) ... [2024-10-11 07:04:21,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:21" (1/1) ... [2024-10-11 07:04:21,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:21" (1/1) ... [2024-10-11 07:04:21,682 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-10-11 07:04:21,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:21" (1/1) ... [2024-10-11 07:04:21,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:21" (1/1) ... [2024-10-11 07:04:21,751 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:21" (1/1) ... [2024-10-11 07:04:21,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:21" (1/1) ... [2024-10-11 07:04:21,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:21" (1/1) ... [2024-10-11 07:04:21,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:21" (1/1) ... [2024-10-11 07:04:21,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:04:21,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:04:21,933 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:04:21,933 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:04:21,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:21" (1/1) ... [2024-10-11 07:04:21,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:04:21,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:04:21,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:04:21,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:04:22,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:04:22,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:04:22,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:04:22,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:04:22,352 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:04:22,354 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:04:24,534 INFO L? ?]: Removed 1401 outVars from TransFormulas that were not future-live. [2024-10-11 07:04:24,535 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:04:24,620 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:04:24,620 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:04:24,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:04:24 BoogieIcfgContainer [2024-10-11 07:04:24,621 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:04:24,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:04:24,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:04:24,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:04:24,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:04:20" (1/3) ... [2024-10-11 07:04:24,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4a9595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:04:24, skipping insertion in model container [2024-10-11 07:04:24,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:21" (2/3) ... [2024-10-11 07:04:24,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4a9595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:04:24, skipping insertion in model container [2024-10-11 07:04:24,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:04:24" (3/3) ... [2024-10-11 07:04:24,634 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p12.c [2024-10-11 07:04:24,652 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:04:24,653 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:04:24,733 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:04:24,742 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;@65a8803a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:04:24,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:04:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 568 states, 566 states have (on average 1.5017667844522968) internal successors, (850), 567 states have internal predecessors, (850), 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-10-11 07:04:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 07:04:24,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:24,764 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:24,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:24,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:24,771 INFO L85 PathProgramCache]: Analyzing trace with hash -302579251, now seen corresponding path program 1 times [2024-10-11 07:04:24,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:24,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751719443] [2024-10-11 07:04:24,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:24,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:25,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:25,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:25,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751719443] [2024-10-11 07:04:25,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751719443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:25,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:25,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:04:25,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553408616] [2024-10-11 07:04:25,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:25,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:04:25,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:25,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:04:25,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:04:25,700 INFO L87 Difference]: Start difference. First operand has 568 states, 566 states have (on average 1.5017667844522968) internal successors, (850), 567 states have internal predecessors, (850), 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 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:25,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:25,831 INFO L93 Difference]: Finished difference Result 1084 states and 1624 transitions. [2024-10-11 07:04:25,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:04:25,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-11 07:04:25,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:25,855 INFO L225 Difference]: With dead ends: 1084 [2024-10-11 07:04:25,855 INFO L226 Difference]: Without dead ends: 569 [2024-10-11 07:04:25,861 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-10-11 07:04:25,867 INFO L432 NwaCegarLoop]: 845 mSDtfsCounter, 0 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2530 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:25,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2530 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:04:25,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-10-11 07:04:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2024-10-11 07:04:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.4964788732394365) internal successors, (850), 568 states have internal predecessors, (850), 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-10-11 07:04:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 850 transitions. [2024-10-11 07:04:25,951 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 850 transitions. Word has length 60 [2024-10-11 07:04:25,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:25,952 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 850 transitions. [2024-10-11 07:04:25,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 850 transitions. [2024-10-11 07:04:25,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 07:04:25,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:25,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:25,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:04:25,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:25,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:25,956 INFO L85 PathProgramCache]: Analyzing trace with hash -788326672, now seen corresponding path program 1 times [2024-10-11 07:04:25,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:25,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714155495] [2024-10-11 07:04:25,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:25,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:26,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:26,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714155495] [2024-10-11 07:04:26,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714155495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:26,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:26,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:04:26,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184035714] [2024-10-11 07:04:26,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:26,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:04:26,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:26,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:04:26,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:04:26,222 INFO L87 Difference]: Start difference. First operand 569 states and 850 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-10-11 07:04:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:26,267 INFO L93 Difference]: Finished difference Result 1087 states and 1624 transitions. [2024-10-11 07:04:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:04:26,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2024-10-11 07:04:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:26,271 INFO L225 Difference]: With dead ends: 1087 [2024-10-11 07:04:26,271 INFO L226 Difference]: Without dead ends: 571 [2024-10-11 07:04:26,272 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-10-11 07:04:26,275 INFO L432 NwaCegarLoop]: 845 mSDtfsCounter, 0 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2527 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:26,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2527 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:04:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-10-11 07:04:26,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2024-10-11 07:04:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 570 states have (on average 1.4947368421052631) internal successors, (852), 570 states have internal predecessors, (852), 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-10-11 07:04:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 852 transitions. [2024-10-11 07:04:26,308 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 852 transitions. Word has length 61 [2024-10-11 07:04:26,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:26,310 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 852 transitions. [2024-10-11 07:04:26,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-10-11 07:04:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 852 transitions. [2024-10-11 07:04:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 07:04:26,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:26,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:26,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:04:26,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:26,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash 233711366, now seen corresponding path program 1 times [2024-10-11 07:04:26,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:26,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581241695] [2024-10-11 07:04:26,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:26,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:27,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:27,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:27,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581241695] [2024-10-11 07:04:27,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581241695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:27,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:27,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 07:04:27,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925601552] [2024-10-11 07:04:27,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:27,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:04:27,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:27,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:04:27,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:04:27,065 INFO L87 Difference]: Start difference. First operand 571 states and 852 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 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-10-11 07:04:27,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:27,209 INFO L93 Difference]: Finished difference Result 1096 states and 1636 transitions. [2024-10-11 07:04:27,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:04:27,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 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 62 [2024-10-11 07:04:27,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:27,214 INFO L225 Difference]: With dead ends: 1096 [2024-10-11 07:04:27,214 INFO L226 Difference]: Without dead ends: 578 [2024-10-11 07:04:27,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:04:27,216 INFO L432 NwaCegarLoop]: 837 mSDtfsCounter, 804 mSDsluCounter, 3338 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 4175 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:27,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 4175 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:04:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-10-11 07:04:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 577. [2024-10-11 07:04:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 1.4913194444444444) internal successors, (859), 576 states have internal predecessors, (859), 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-10-11 07:04:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 859 transitions. [2024-10-11 07:04:27,238 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 859 transitions. Word has length 62 [2024-10-11 07:04:27,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:27,239 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 859 transitions. [2024-10-11 07:04:27,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 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-10-11 07:04:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 859 transitions. [2024-10-11 07:04:27,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 07:04:27,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:27,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:27,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:04:27,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:27,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:27,246 INFO L85 PathProgramCache]: Analyzing trace with hash -435995081, now seen corresponding path program 1 times [2024-10-11 07:04:27,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:27,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5251560] [2024-10-11 07:04:27,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:27,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:27,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:27,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5251560] [2024-10-11 07:04:27,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5251560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:27,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:27,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 07:04:27,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917651493] [2024-10-11 07:04:27,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:27,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 07:04:27,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:27,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 07:04:27,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:04:27,915 INFO L87 Difference]: Start difference. First operand 577 states and 859 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 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-10-11 07:04:28,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:28,444 INFO L93 Difference]: Finished difference Result 1391 states and 2066 transitions. [2024-10-11 07:04:28,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 07:04:28,445 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 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 63 [2024-10-11 07:04:28,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:28,450 INFO L225 Difference]: With dead ends: 1391 [2024-10-11 07:04:28,450 INFO L226 Difference]: Without dead ends: 867 [2024-10-11 07:04:28,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-10-11 07:04:28,455 INFO L432 NwaCegarLoop]: 813 mSDtfsCounter, 1685 mSDsluCounter, 5700 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1685 SdHoareTripleChecker+Valid, 6513 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:28,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1685 Valid, 6513 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 07:04:28,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-10-11 07:04:28,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 631. [2024-10-11 07:04:28,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 630 states have (on average 1.492063492063492) internal successors, (940), 630 states have internal predecessors, (940), 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-10-11 07:04:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 940 transitions. [2024-10-11 07:04:28,471 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 940 transitions. Word has length 63 [2024-10-11 07:04:28,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:28,471 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 940 transitions. [2024-10-11 07:04:28,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 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-10-11 07:04:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 940 transitions. [2024-10-11 07:04:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 07:04:28,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:28,473 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:28,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:04:28,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:28,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:28,474 INFO L85 PathProgramCache]: Analyzing trace with hash 219663219, now seen corresponding path program 1 times [2024-10-11 07:04:28,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:28,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12791923] [2024-10-11 07:04:28,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:28,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:29,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:29,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12791923] [2024-10-11 07:04:29,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12791923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:29,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:29,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 07:04:29,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118307443] [2024-10-11 07:04:29,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:29,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:04:29,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:29,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:04:29,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:04:29,171 INFO L87 Difference]: Start difference. First operand 631 states and 940 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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-10-11 07:04:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:29,483 INFO L93 Difference]: Finished difference Result 1384 states and 2058 transitions. [2024-10-11 07:04:29,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 07:04:29,484 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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 63 [2024-10-11 07:04:29,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:29,488 INFO L225 Difference]: With dead ends: 1384 [2024-10-11 07:04:29,489 INFO L226 Difference]: Without dead ends: 860 [2024-10-11 07:04:29,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-11 07:04:29,493 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 1665 mSDsluCounter, 4937 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 5761 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:29,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1665 Valid, 5761 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:04:29,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2024-10-11 07:04:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 632. [2024-10-11 07:04:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 1.4896988906497624) internal successors, (940), 631 states have internal predecessors, (940), 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-10-11 07:04:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 940 transitions. [2024-10-11 07:04:29,507 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 940 transitions. Word has length 63 [2024-10-11 07:04:29,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:29,508 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 940 transitions. [2024-10-11 07:04:29,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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-10-11 07:04:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 940 transitions. [2024-10-11 07:04:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 07:04:29,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:29,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:29,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:04:29,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:29,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash 933599842, now seen corresponding path program 1 times [2024-10-11 07:04:29,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:29,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901988475] [2024-10-11 07:04:29,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:29,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:30,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:30,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901988475] [2024-10-11 07:04:30,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901988475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:30,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:30,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 07:04:30,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947991133] [2024-10-11 07:04:30,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:30,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 07:04:30,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:30,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 07:04:30,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:04:30,117 INFO L87 Difference]: Start difference. First operand 632 states and 940 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 states have internal predecessors, (64), 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-10-11 07:04:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:30,521 INFO L93 Difference]: Finished difference Result 1385 states and 2057 transitions. [2024-10-11 07:04:30,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 07:04:30,522 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 states have internal predecessors, (64), 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 64 [2024-10-11 07:04:30,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:30,525 INFO L225 Difference]: With dead ends: 1385 [2024-10-11 07:04:30,526 INFO L226 Difference]: Without dead ends: 861 [2024-10-11 07:04:30,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-10-11 07:04:30,528 INFO L432 NwaCegarLoop]: 820 mSDtfsCounter, 1673 mSDsluCounter, 5739 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 6559 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:30,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 6559 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:04:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-11 07:04:30,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 632. [2024-10-11 07:04:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 1.4881141045958794) internal successors, (939), 631 states have internal predecessors, (939), 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-10-11 07:04:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 939 transitions. [2024-10-11 07:04:30,546 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 939 transitions. Word has length 64 [2024-10-11 07:04:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:30,547 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 939 transitions. [2024-10-11 07:04:30,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 states have internal predecessors, (64), 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-10-11 07:04:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 939 transitions. [2024-10-11 07:04:30,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 07:04:30,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:30,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:30,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 07:04:30,551 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:30,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:30,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1059540526, now seen corresponding path program 1 times [2024-10-11 07:04:30,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:30,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329210148] [2024-10-11 07:04:30,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:30,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:30,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:30,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329210148] [2024-10-11 07:04:30,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329210148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:30,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:30,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:04:30,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723314251] [2024-10-11 07:04:30,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:30,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:04:30,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:30,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:04:30,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:04:30,743 INFO L87 Difference]: Start difference. First operand 632 states and 939 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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-10-11 07:04:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:30,878 INFO L93 Difference]: Finished difference Result 1331 states and 1977 transitions. [2024-10-11 07:04:30,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:04:30,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2024-10-11 07:04:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:30,882 INFO L225 Difference]: With dead ends: 1331 [2024-10-11 07:04:30,882 INFO L226 Difference]: Without dead ends: 806 [2024-10-11 07:04:30,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:04:30,883 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 1475 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:30,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 2486 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:04:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-10-11 07:04:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 631. [2024-10-11 07:04:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 630 states have (on average 1.4873015873015873) internal successors, (937), 630 states have internal predecessors, (937), 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-10-11 07:04:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 937 transitions. [2024-10-11 07:04:30,898 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 937 transitions. Word has length 64 [2024-10-11 07:04:30,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:30,898 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 937 transitions. [2024-10-11 07:04:30,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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-10-11 07:04:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 937 transitions. [2024-10-11 07:04:30,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 07:04:30,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:30,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:30,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 07:04:30,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:30,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:30,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1879836549, now seen corresponding path program 1 times [2024-10-11 07:04:30,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:30,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138930282] [2024-10-11 07:04:30,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:30,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:31,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:31,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138930282] [2024-10-11 07:04:31,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138930282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:31,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:31,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:04:31,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509390964] [2024-10-11 07:04:31,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:31,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:04:31,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:31,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:04:31,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:04:31,070 INFO L87 Difference]: Start difference. First operand 631 states and 937 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-10-11 07:04:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:31,111 INFO L93 Difference]: Finished difference Result 1190 states and 1769 transitions. [2024-10-11 07:04:31,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:04:31,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2024-10-11 07:04:31,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:31,114 INFO L225 Difference]: With dead ends: 1190 [2024-10-11 07:04:31,114 INFO L226 Difference]: Without dead ends: 659 [2024-10-11 07:04:31,115 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-10-11 07:04:31,116 INFO L432 NwaCegarLoop]: 844 mSDtfsCounter, 12 mSDsluCounter, 2523 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:31,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3367 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:04:31,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-10-11 07:04:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2024-10-11 07:04:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.4848024316109423) internal successors, (977), 658 states have internal predecessors, (977), 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-10-11 07:04:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 977 transitions. [2024-10-11 07:04:31,129 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 977 transitions. Word has length 65 [2024-10-11 07:04:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:31,130 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 977 transitions. [2024-10-11 07:04:31,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-10-11 07:04:31,130 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 977 transitions. [2024-10-11 07:04:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 07:04:31,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:31,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:31,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 07:04:31,132 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:31,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:31,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1421387879, now seen corresponding path program 1 times [2024-10-11 07:04:31,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:31,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213617085] [2024-10-11 07:04:31,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:31,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:33,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:33,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213617085] [2024-10-11 07:04:33,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213617085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:33,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:33,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-11 07:04:33,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607583777] [2024-10-11 07:04:33,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:33,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 07:04:33,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:33,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 07:04:33,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2024-10-11 07:04:33,261 INFO L87 Difference]: Start difference. First operand 659 states and 977 transitions. Second operand has 20 states, 20 states have (on average 3.3) internal successors, (66), 19 states have internal predecessors, (66), 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-10-11 07:04:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:34,528 INFO L93 Difference]: Finished difference Result 1279 states and 1893 transitions. [2024-10-11 07:04:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 07:04:34,529 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 19 states have internal predecessors, (66), 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 66 [2024-10-11 07:04:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:34,532 INFO L225 Difference]: With dead ends: 1279 [2024-10-11 07:04:34,532 INFO L226 Difference]: Without dead ends: 741 [2024-10-11 07:04:34,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=1124, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 07:04:34,534 INFO L432 NwaCegarLoop]: 802 mSDtfsCounter, 1175 mSDsluCounter, 12015 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 12817 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:34,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 12817 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 07:04:34,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-10-11 07:04:34,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 697. [2024-10-11 07:04:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 696 states have (on average 1.485632183908046) internal successors, (1034), 696 states have internal predecessors, (1034), 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-10-11 07:04:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1034 transitions. [2024-10-11 07:04:34,548 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1034 transitions. Word has length 66 [2024-10-11 07:04:34,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:34,548 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1034 transitions. [2024-10-11 07:04:34,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 19 states have internal predecessors, (66), 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-10-11 07:04:34,548 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1034 transitions. [2024-10-11 07:04:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 07:04:34,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:34,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:34,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 07:04:34,549 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:34,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:34,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1617070542, now seen corresponding path program 1 times [2024-10-11 07:04:34,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:34,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805783967] [2024-10-11 07:04:34,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:34,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:04:34,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:04:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:04:34,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:04:34,764 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:04:34,765 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:04:34,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 07:04:34,770 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:34,846 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:04:34,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:04:34 BoogieIcfgContainer [2024-10-11 07:04:34,849 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:04:34,849 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:04:34,850 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:04:34,850 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:04:34,850 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:04:24" (3/4) ... [2024-10-11 07:04:34,852 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:04:34,853 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:04:34,854 INFO L158 Benchmark]: Toolchain (without parser) took 14336.01ms. Allocated memory was 186.6MB in the beginning and 757.1MB in the end (delta: 570.4MB). Free memory was 116.8MB in the beginning and 362.2MB in the end (delta: -245.4MB). Peak memory consumption was 325.6MB. Max. memory is 16.1GB. [2024-10-11 07:04:34,854 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:04:34,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 729.49ms. Allocated memory is still 186.6MB. Free memory was 116.8MB in the beginning and 143.1MB in the end (delta: -26.4MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2024-10-11 07:04:34,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 273.37ms. Allocated memory is still 186.6MB. Free memory was 142.8MB in the beginning and 90.7MB in the end (delta: 52.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-10-11 07:04:34,855 INFO L158 Benchmark]: Boogie Preprocessor took 388.00ms. Allocated memory is still 186.6MB. Free memory was 90.7MB in the beginning and 121.6MB in the end (delta: -30.9MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2024-10-11 07:04:34,855 INFO L158 Benchmark]: RCFGBuilder took 2688.09ms. Allocated memory was 186.6MB in the beginning and 360.7MB in the end (delta: 174.1MB). Free memory was 121.6MB in the beginning and 193.2MB in the end (delta: -71.6MB). Peak memory consumption was 124.8MB. Max. memory is 16.1GB. [2024-10-11 07:04:34,855 INFO L158 Benchmark]: TraceAbstraction took 10226.29ms. Allocated memory was 360.7MB in the beginning and 757.1MB in the end (delta: 396.4MB). Free memory was 192.2MB in the beginning and 362.2MB in the end (delta: -170.0MB). Peak memory consumption was 225.3MB. Max. memory is 16.1GB. [2024-10-11 07:04:34,856 INFO L158 Benchmark]: Witness Printer took 3.81ms. Allocated memory is still 757.1MB. Free memory is still 362.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:04:34,857 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.13ms. Allocated memory is still 186.6MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 729.49ms. Allocated memory is still 186.6MB. Free memory was 116.8MB in the beginning and 143.1MB in the end (delta: -26.4MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 273.37ms. Allocated memory is still 186.6MB. Free memory was 142.8MB in the beginning and 90.7MB in the end (delta: 52.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 388.00ms. Allocated memory is still 186.6MB. Free memory was 90.7MB in the beginning and 121.6MB in the end (delta: -30.9MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. * RCFGBuilder took 2688.09ms. Allocated memory was 186.6MB in the beginning and 360.7MB in the end (delta: 174.1MB). Free memory was 121.6MB in the beginning and 193.2MB in the end (delta: -71.6MB). Peak memory consumption was 124.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10226.29ms. Allocated memory was 360.7MB in the beginning and 757.1MB in the end (delta: 396.4MB). Free memory was 192.2MB in the beginning and 362.2MB in the end (delta: -170.0MB). Peak memory consumption was 225.3MB. Max. memory is 16.1GB. * Witness Printer took 3.81ms. Allocated memory is still 757.1MB. Free memory is still 362.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 205, overapproximation of bitwiseAnd at line 210. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 3); [L36] const SORT_7 msb_SORT_7 = (SORT_7)1 << (3 - 1); [L38] const SORT_26 mask_SORT_26 = (SORT_26)-1 >> (sizeof(SORT_26) * 8 - 2); [L39] const SORT_26 msb_SORT_26 = (SORT_26)1 << (2 - 1); [L41] const SORT_108 mask_SORT_108 = (SORT_108)-1 >> (sizeof(SORT_108) * 8 - 4); [L42] const SORT_108 msb_SORT_108 = (SORT_108)1 << (4 - 1); [L44] const SORT_165 mask_SORT_165 = (SORT_165)-1 >> (sizeof(SORT_165) * 8 - 32); [L45] const SORT_165 msb_SORT_165 = (SORT_165)1 << (32 - 1); [L47] const SORT_7 var_8 = 0; [L48] const SORT_3 var_15 = 0; [L49] const SORT_1 var_41 = 1; [L50] const SORT_1 var_51 = 0; [L51] const SORT_5 var_54 = 0; [L52] const SORT_7 var_68 = 2; [L53] const SORT_7 var_72 = 1; [L54] const SORT_7 var_77 = 4; [L55] const SORT_7 var_79 = 5; [L56] const SORT_7 var_83 = 3; [L57] const SORT_3 var_95 = 2; [L58] const SORT_7 var_125 = 7; [L59] const SORT_7 var_130 = 6; [L60] const SORT_165 var_167 = 0; [L61] const SORT_3 var_197 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_186; [L67] SORT_3 input_187; [L68] SORT_3 input_188; [L69] SORT_3 input_196; [L70] SORT_3 input_206; [L71] SORT_3 input_207; [L72] SORT_3 input_208; [L73] SORT_3 input_211; [L74] SORT_3 input_230; [L75] SORT_3 input_231; [L76] SORT_3 input_232; [L77] SORT_3 input_235; [L78] SORT_3 input_237; [L79] SORT_26 input_251; [L80] SORT_26 input_252; [L81] SORT_26 input_253; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L83] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L84] SORT_3 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L85] SORT_3 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L86] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L87] SORT_3 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L88] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L89] SORT_1 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L90] SORT_5 state_55 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L91] SORT_3 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L92] SORT_3 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L93] SORT_3 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L94] SORT_3 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L95] SORT_3 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] SORT_7 init_10_arg_1 = var_8; [L98] state_9 = init_10_arg_1 [L99] SORT_3 init_17_arg_1 = var_15; [L100] state_16 = init_17_arg_1 [L101] SORT_3 init_20_arg_1 = var_15; [L102] state_19 = init_20_arg_1 [L103] SORT_3 init_46_arg_1 = var_15; [L104] state_45 = init_46_arg_1 [L105] SORT_3 init_48_arg_1 = var_15; [L106] state_47 = init_48_arg_1 [L107] SORT_3 init_50_arg_1 = var_15; [L108] state_49 = init_50_arg_1 [L109] SORT_1 init_53_arg_1 = var_51; [L110] state_52 = init_53_arg_1 [L111] SORT_5 init_56_arg_1 = var_54; [L112] state_55 = init_56_arg_1 [L113] SORT_3 init_58_arg_1 = var_15; [L114] state_57 = init_58_arg_1 [L115] SORT_3 init_60_arg_1 = var_15; [L116] state_59 = init_60_arg_1 [L117] SORT_3 init_62_arg_1 = var_15; [L118] state_61 = init_62_arg_1 [L119] SORT_3 init_64_arg_1 = var_15; [L120] state_63 = init_64_arg_1 [L121] SORT_3 init_66_arg_1 = var_15; [L122] state_65 = init_66_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_186 = __VERIFIER_nondet_uchar() [L129] input_187 = __VERIFIER_nondet_uchar() [L130] input_188 = __VERIFIER_nondet_uchar() [L131] input_196 = __VERIFIER_nondet_uchar() [L132] input_206 = __VERIFIER_nondet_uchar() [L133] input_207 = __VERIFIER_nondet_uchar() [L134] input_208 = __VERIFIER_nondet_uchar() [L135] input_211 = __VERIFIER_nondet_uchar() [L136] input_230 = __VERIFIER_nondet_uchar() [L137] input_231 = __VERIFIER_nondet_uchar() [L138] input_232 = __VERIFIER_nondet_uchar() [L139] input_235 = __VERIFIER_nondet_uchar() [L140] input_237 = __VERIFIER_nondet_uchar() [L141] input_251 = __VERIFIER_nondet_uchar() [L142] input_252 = __VERIFIER_nondet_uchar() [L143] input_253 = __VERIFIER_nondet_uchar() [L146] SORT_7 var_11_arg_0 = state_9; [L147] SORT_1 var_11 = var_11_arg_0 >> 0; [L148] SORT_7 var_12_arg_0 = state_9; [L149] SORT_1 var_12 = var_12_arg_0 >> 1; [L150] SORT_1 var_13_arg_0 = var_11; [L151] SORT_1 var_13_arg_1 = var_12; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_13_arg_0=0, var_13_arg_1=0, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L152] EXPR var_13_arg_0 | var_13_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L152] SORT_1 var_13 = var_13_arg_0 | var_13_arg_1; [L153] SORT_1 var_14_arg_0 = var_13; [L154] SORT_1 var_14 = ~var_14_arg_0; [L155] SORT_3 var_18_arg_0 = state_16; [L156] SORT_1 var_18 = var_18_arg_0 >> 1; [L157] SORT_3 var_21_arg_0 = state_19; [L158] SORT_7 var_21 = var_21_arg_0 >> 2; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_18=0, var_197=31, var_21=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L159] EXPR var_21 & mask_SORT_7 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_18=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L159] var_21 = var_21 & mask_SORT_7 [L160] SORT_3 var_22_arg_0 = state_16; [L161] SORT_7 var_22 = var_22_arg_0 >> 2; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_18=0, var_197=31, var_21=0, var_22=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L162] EXPR var_22 & mask_SORT_7 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_18=0, var_197=31, var_21=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L162] var_22 = var_22 & mask_SORT_7 [L163] SORT_7 var_23_arg_0 = var_21; [L164] SORT_7 var_23_arg_1 = var_22; [L165] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L166] SORT_1 var_24_arg_0 = var_18; [L167] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24_arg_0=0, var_24_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L168] EXPR var_24_arg_0 | var_24_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L168] SORT_1 var_24 = var_24_arg_0 | var_24_arg_1; [L169] SORT_3 var_25_arg_0 = state_16; [L170] SORT_1 var_25 = var_25_arg_0 >> 2; [L171] SORT_3 var_27_arg_0 = state_19; [L172] SORT_26 var_27 = var_27_arg_0 >> 3; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_25=0, var_27=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L173] EXPR var_27 & mask_SORT_26 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_25=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L173] var_27 = var_27 & mask_SORT_26 [L174] SORT_3 var_28_arg_0 = state_16; [L175] SORT_26 var_28 = var_28_arg_0 >> 3; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_25=0, var_27=0, var_28=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L176] EXPR var_28 & mask_SORT_26 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_25=0, var_27=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L176] var_28 = var_28 & mask_SORT_26 [L177] SORT_26 var_29_arg_0 = var_27; [L178] SORT_26 var_29_arg_1 = var_28; [L179] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L180] SORT_1 var_30_arg_0 = var_25; [L181] SORT_1 var_30_arg_1 = var_29; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_30_arg_0=0, var_30_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L182] EXPR var_30_arg_0 | var_30_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L182] SORT_1 var_30 = var_30_arg_0 | var_30_arg_1; [L183] SORT_1 var_31_arg_0 = var_24; [L184] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31_arg_0=1, var_31_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L185] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L185] SORT_1 var_31 = var_31_arg_0 & var_31_arg_1; [L186] SORT_3 var_32_arg_0 = state_16; [L187] SORT_1 var_32 = var_32_arg_0 >> 3; [L188] SORT_3 var_33_arg_0 = state_19; [L189] SORT_1 var_33 = var_33_arg_0 >> 4; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_32=0, var_33=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L190] EXPR var_33 & mask_SORT_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_32=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L190] var_33 = var_33 & mask_SORT_1 [L191] SORT_3 var_34_arg_0 = state_16; [L192] SORT_1 var_34 = var_34_arg_0 >> 4; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_32=0, var_33=0, var_34=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L193] EXPR var_34 & mask_SORT_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_32=0, var_33=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L193] var_34 = var_34 & mask_SORT_1 [L194] SORT_1 var_35_arg_0 = var_33; [L195] SORT_1 var_35_arg_1 = var_34; [L196] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L197] SORT_1 var_36_arg_0 = var_32; [L198] SORT_1 var_36_arg_1 = var_35; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_36_arg_0=0, var_36_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L199] EXPR var_36_arg_0 | var_36_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L199] SORT_1 var_36 = var_36_arg_0 | var_36_arg_1; [L200] SORT_1 var_37_arg_0 = var_31; [L201] SORT_1 var_37_arg_1 = var_36; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_37_arg_0=1, var_37_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L202] EXPR var_37_arg_0 & var_37_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L202] SORT_1 var_37 = var_37_arg_0 & var_37_arg_1; [L203] SORT_1 var_38_arg_0 = var_14; [L204] SORT_1 var_38_arg_1 = var_37; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_38_arg_0=-1, var_38_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L205] EXPR var_38_arg_0 | var_38_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L205] SORT_1 var_38 = var_38_arg_0 | var_38_arg_1; [L206] SORT_1 var_42_arg_0 = var_38; [L207] SORT_1 var_42 = ~var_42_arg_0; [L208] SORT_1 var_43_arg_0 = var_41; [L209] SORT_1 var_43_arg_1 = var_42; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_43_arg_0=1, var_43_arg_1=-1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L210] EXPR var_43_arg_0 & var_43_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L210] SORT_1 var_43 = var_43_arg_0 & var_43_arg_1; [L211] EXPR var_43 & mask_SORT_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L211] var_43 = var_43 & mask_SORT_1 [L212] SORT_1 bad_44_arg_0 = var_43; [L213] CALL __VERIFIER_assert(!(bad_44_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 568 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8489 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8489 mSDsluCounter, 46735 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39275 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1664 IncrementalHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 7460 mSDtfsCounter, 1664 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=697occurred in iteration=9, InterpolantAutomatonStates: 73, 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, 9 MinimizatonAttempts, 913 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 635 NumberOfCodeBlocks, 635 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 559 ConstructedInterpolants, 0 QuantifiedInterpolants, 2959 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 could not prove your program: unable to determine feasibility of some traces [2024-10-11 07:04:34,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d570de8a468b2e5d7e18a67170da2d8f06202ccdf10baa0799e3c0763140866e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:04:37,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:04:37,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 07:04:37,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:04:37,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:04:37,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:04:37,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:04:37,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:04:37,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:04:37,293 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:04:37,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:04:37,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:04:37,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:04:37,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:04:37,296 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:04:37,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:04:37,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:04:37,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:04:37,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:04:37,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:04:37,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:04:37,302 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:04:37,302 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:04:37,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:04:37,303 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:04:37,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:04:37,303 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:04:37,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:04:37,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:04:37,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:04:37,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:04:37,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:04:37,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:04:37,305 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:04:37,305 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:04:37,305 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:04:37,306 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:04:37,306 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:04:37,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:04:37,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:04:37,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:04:37,307 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:04:37,308 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-clean/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-clean/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 -> d570de8a468b2e5d7e18a67170da2d8f06202ccdf10baa0799e3c0763140866e [2024-10-11 07:04:37,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:04:37,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:04:37,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:04:37,678 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:04:37,679 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:04:37,680 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c [2024-10-11 07:04:39,202 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:04:39,472 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:04:39,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c [2024-10-11 07:04:39,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1dcc0a687/4a8d8a1a029040ad86e00df5a76aaa79/FLAGb9944f4bf [2024-10-11 07:04:39,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1dcc0a687/4a8d8a1a029040ad86e00df5a76aaa79 [2024-10-11 07:04:39,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:04:39,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:04:39,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:04:39,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:04:39,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:04:39,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:04:39" (1/1) ... [2024-10-11 07:04:39,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0bd194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:39, skipping insertion in model container [2024-10-11 07:04:39,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:04:39" (1/1) ... [2024-10-11 07:04:39,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:04:40,097 WARN L248 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_arrays_vsaR_p12.c[1259,1272] [2024-10-11 07:04:40,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:04:40,378 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:04:40,389 WARN L248 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_arrays_vsaR_p12.c[1259,1272] [2024-10-11 07:04:40,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:04:40,528 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:04:40,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:40 WrapperNode [2024-10-11 07:04:40,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:04:40,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:04:40,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:04:40,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:04:40,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:40" (1/1) ... [2024-10-11 07:04:40,581 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:40" (1/1) ... [2024-10-11 07:04:40,645 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1117 [2024-10-11 07:04:40,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:04:40,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:04:40,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:04:40,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:04:40,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:40" (1/1) ... [2024-10-11 07:04:40,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:40" (1/1) ... [2024-10-11 07:04:40,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:40" (1/1) ... [2024-10-11 07:04:40,745 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-10-11 07:04:40,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:40" (1/1) ... [2024-10-11 07:04:40,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:40" (1/1) ... [2024-10-11 07:04:40,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:40" (1/1) ... [2024-10-11 07:04:40,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:40" (1/1) ... [2024-10-11 07:04:40,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:40" (1/1) ... [2024-10-11 07:04:40,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:40" (1/1) ... [2024-10-11 07:04:40,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:04:40,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:04:40,803 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:04:40,803 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:04:40,804 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:40" (1/1) ... [2024-10-11 07:04:40,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:04:40,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:04:40,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:04:40,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:04:40,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:04:40,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:04:40,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:04:40,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:04:41,189 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:04:41,191 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:04:42,588 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-10-11 07:04:42,588 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:04:42,658 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:04:42,659 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:04:42,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:04:42 BoogieIcfgContainer [2024-10-11 07:04:42,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:04:42,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:04:42,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:04:42,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:04:42,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:04:39" (1/3) ... [2024-10-11 07:04:42,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e64974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:04:42, skipping insertion in model container [2024-10-11 07:04:42,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:40" (2/3) ... [2024-10-11 07:04:42,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e64974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:04:42, skipping insertion in model container [2024-10-11 07:04:42,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:04:42" (3/3) ... [2024-10-11 07:04:42,669 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p12.c [2024-10-11 07:04:42,684 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:04:42,685 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:04:42,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:04:42,737 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;@702c3554, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:04:42,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:04:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-10-11 07:04:42,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 07:04:42,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:42,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 07:04:42,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:42,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:42,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 07:04:42,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:04:42,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939073289] [2024-10-11 07:04:42,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:42,767 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-10-11 07:04:42,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:04:42,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 07:04:42,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:04:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:43,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-11 07:04:43,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:04:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:43,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:04:43,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:04:43,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939073289] [2024-10-11 07:04:43,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939073289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:43,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:43,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:04:43,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973682868] [2024-10-11 07:04:43,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:43,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:04:43,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:04:43,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:04:43,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:04:43,526 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 07:04:43,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:43,632 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 07:04:43,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:04:43,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-11 07:04:43,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:43,642 INFO L225 Difference]: With dead ends: 15 [2024-10-11 07:04:43,642 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 07:04:43,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:04:43,650 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:43,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:04:43,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 07:04:43,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 07:04:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-10-11 07:04:43,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 07:04:43,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 07:04:43,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:43,703 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 07:04:43,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 07:04:43,704 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 07:04:43,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 07:04:43,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:43,709 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 07:04:43,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 07:04:43,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 07:04:43,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:43,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:43,911 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 07:04:43,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:04:43,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706888895] [2024-10-11 07:04:43,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:43,913 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-10-11 07:04:43,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:04:43,915 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 07:04:43,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:04:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:44,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-11 07:04:44,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:04:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:44,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:04:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:58,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:04:58,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706888895] [2024-10-11 07:04:58,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706888895] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:04:58,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:04:58,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 07:04:58,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364484951] [2024-10-11 07:04:58,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:04:58,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:04:58,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:04:58,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:04:58,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=39, Unknown=1, NotChecked=0, Total=56 [2024-10-11 07:04:58,810 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-10-11 07:04:59,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:59,398 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-11 07:04:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:04:59,399 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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 7 [2024-10-11 07:04:59,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:59,399 INFO L225 Difference]: With dead ends: 14 [2024-10-11 07:04:59,400 INFO L226 Difference]: Without dead ends: 12 [2024-10-11 07:04:59,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=35, Invalid=74, Unknown=1, NotChecked=0, Total=110 [2024-10-11 07:04:59,402 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:59,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 07:04:59,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-11 07:04:59,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-11 07:04:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-10-11 07:04:59,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-11 07:04:59,407 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-11 07:04:59,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:59,407 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-11 07:04:59,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-10-11 07:04:59,408 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-11 07:04:59,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 07:04:59,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:59,408 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-11 07:04:59,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 07:04:59,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 07:04:59,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:59,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:59,610 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-11 07:04:59,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:04:59,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048582455] [2024-10-11 07:04:59,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 07:04:59,612 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-10-11 07:04:59,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:04:59,615 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 07:04:59,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (4)] Waiting until timeout for monitored process [2024-10-11 07:05:00,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 07:05:00,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 07:05:00,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-11 07:05:00,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:05:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:05:00,760 INFO L311 TraceCheckSpWp]: Computing backward predicates...