./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ad777bd82b2fbfc07486a835bf99ca2e475906af4a3b134d048b1c18acbc93b4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:18:05,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:18:05,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 19:18:05,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:18:05,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:18:05,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:18:05,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:18:05,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:18:05,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:18:05,309 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:18:05,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:18:05,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:18:05,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:18:05,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:18:05,312 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:18:05,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:18:05,313 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:18:05,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:18:05,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:18:05,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:18:05,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:18:05,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:18:05,315 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:18:05,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:18:05,316 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:18:05,319 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:18:05,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:18:05,319 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:18:05,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:18:05,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:18:05,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:18:05,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:18:05,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:18:05,321 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:18:05,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:18:05,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:18:05,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:18:05,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:18:05,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:18:05,323 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad777bd82b2fbfc07486a835bf99ca2e475906af4a3b134d048b1c18acbc93b4 [2024-11-08 19:18:05,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:18:05,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:18:05,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:18:05,609 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:18:05,610 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:18:05,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-11-08 19:18:07,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:18:07,436 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:18:07,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-11-08 19:18:07,460 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55ce2ae87/5a9988bc6f904104b7bf9acdee8a0f3d/FLAG23cd9e0fc [2024-11-08 19:18:07,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55ce2ae87/5a9988bc6f904104b7bf9acdee8a0f3d [2024-11-08 19:18:07,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:18:07,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:18:07,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:18:07,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:18:07,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:18:07,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:18:07" (1/1) ... [2024-11-08 19:18:07,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6530539b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:07, skipping insertion in model container [2024-11-08 19:18:07,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:18:07" (1/1) ... [2024-11-08 19:18:07,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:18:08,022 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c[1259,1272] [2024-11-08 19:18:08,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:18:08,340 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:18:08,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c[1259,1272] [2024-11-08 19:18:08,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:18:08,495 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:18:08,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:08 WrapperNode [2024-11-08 19:18:08,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:18:08,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:18:08,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:18:08,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:18:08,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:08" (1/1) ... [2024-11-08 19:18:08,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:08" (1/1) ... [2024-11-08 19:18:08,782 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2173 [2024-11-08 19:18:08,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:18:08,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:18:08,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:18:08,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:18:08,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:08" (1/1) ... [2024-11-08 19:18:08,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:08" (1/1) ... [2024-11-08 19:18:08,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:08" (1/1) ... [2024-11-08 19:18:08,999 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:18:09,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:08" (1/1) ... [2024-11-08 19:18:09,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:08" (1/1) ... [2024-11-08 19:18:09,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:08" (1/1) ... [2024-11-08 19:18:09,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:08" (1/1) ... [2024-11-08 19:18:09,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:08" (1/1) ... [2024-11-08 19:18:09,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:08" (1/1) ... [2024-11-08 19:18:09,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:18:09,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:18:09,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:18:09,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:18:09,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:08" (1/1) ... [2024-11-08 19:18:09,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:18:09,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:18:09,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:18:09,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:18:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:18:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:18:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:18:09,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:18:09,666 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:18:09,668 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:18:11,886 INFO L? ?]: Removed 1359 outVars from TransFormulas that were not future-live. [2024-11-08 19:18:11,887 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:18:11,915 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:18:11,918 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:18:11,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:18:11 BoogieIcfgContainer [2024-11-08 19:18:11,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:18:11,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:18:11,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:18:11,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:18:11,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:18:07" (1/3) ... [2024-11-08 19:18:11,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb0600a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:18:11, skipping insertion in model container [2024-11-08 19:18:11,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:08" (2/3) ... [2024-11-08 19:18:11,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb0600a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:18:11, skipping insertion in model container [2024-11-08 19:18:11,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:18:11" (3/3) ... [2024-11-08 19:18:11,929 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-11-08 19:18:11,949 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:18:11,950 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:18:12,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:18:12,048 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;@2e28b377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:18:12,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:18:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 551 states, 549 states have (on average 1.4990892531876139) internal successors, (823), 550 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 19:18:12,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:12,069 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] [2024-11-08 19:18:12,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:12,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:12,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1622313318, now seen corresponding path program 1 times [2024-11-08 19:18:12,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:12,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709824185] [2024-11-08 19:18:12,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:12,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:13,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:13,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709824185] [2024-11-08 19:18:13,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709824185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:13,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:13,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:18:13,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327748862] [2024-11-08 19:18:13,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:13,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:18:13,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:13,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:18:13,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:18:13,132 INFO L87 Difference]: Start difference. First operand has 551 states, 549 states have (on average 1.4990892531876139) internal successors, (823), 550 states have internal predecessors, (823), 0 states have call successors, (0), 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 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:13,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:13,260 INFO L93 Difference]: Finished difference Result 1047 states and 1567 transitions. [2024-11-08 19:18:13,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:18:13,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-11-08 19:18:13,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:13,283 INFO L225 Difference]: With dead ends: 1047 [2024-11-08 19:18:13,284 INFO L226 Difference]: Without dead ends: 550 [2024-11-08 19:18:13,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:18:13,296 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 0 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2445 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:13,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2445 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-08 19:18:13,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2024-11-08 19:18:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.4954462659380692) internal successors, (821), 549 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 821 transitions. [2024-11-08 19:18:13,389 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 821 transitions. Word has length 53 [2024-11-08 19:18:13,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:13,390 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 821 transitions. [2024-11-08 19:18:13,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 821 transitions. [2024-11-08 19:18:13,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-08 19:18:13,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:13,394 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] [2024-11-08 19:18:13,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:18:13,395 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:13,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:13,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1249590159, now seen corresponding path program 1 times [2024-11-08 19:18:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:13,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28440302] [2024-11-08 19:18:13,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:13,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:13,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:13,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28440302] [2024-11-08 19:18:13,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28440302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:13,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:13,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:18:13,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912453189] [2024-11-08 19:18:13,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:13,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:18:13,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:13,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:18:13,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:18:13,735 INFO L87 Difference]: Start difference. First operand 550 states and 821 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:13,788 INFO L93 Difference]: Finished difference Result 1048 states and 1565 transitions. [2024-11-08 19:18:13,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:18:13,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-08 19:18:13,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:13,795 INFO L225 Difference]: With dead ends: 1048 [2024-11-08 19:18:13,795 INFO L226 Difference]: Without dead ends: 552 [2024-11-08 19:18:13,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:18:13,802 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 0 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2441 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:13,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2441 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:13,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-08 19:18:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-11-08 19:18:13,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 1.4936479128856623) internal successors, (823), 551 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 823 transitions. [2024-11-08 19:18:13,839 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 823 transitions. Word has length 54 [2024-11-08 19:18:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:13,839 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 823 transitions. [2024-11-08 19:18:13,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 823 transitions. [2024-11-08 19:18:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 19:18:13,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:13,841 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] [2024-11-08 19:18:13,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:18:13,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:13,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1015376365, now seen corresponding path program 1 times [2024-11-08 19:18:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:13,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338416943] [2024-11-08 19:18:13,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:13,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:14,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:14,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338416943] [2024-11-08 19:18:14,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338416943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:14,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:14,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:18:14,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836606986] [2024-11-08 19:18:14,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:14,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:18:14,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:14,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:18:14,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:14,484 INFO L87 Difference]: Start difference. First operand 552 states and 823 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:14,594 INFO L93 Difference]: Finished difference Result 1064 states and 1587 transitions. [2024-11-08 19:18:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:18:14,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-11-08 19:18:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:14,598 INFO L225 Difference]: With dead ends: 1064 [2024-11-08 19:18:14,598 INFO L226 Difference]: Without dead ends: 566 [2024-11-08 19:18:14,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:14,603 INFO L432 NwaCegarLoop]: 811 mSDtfsCounter, 10 mSDsluCounter, 4040 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4851 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:14,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4851 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:14,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-08 19:18:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 565. [2024-11-08 19:18:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.4929078014184398) internal successors, (842), 564 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 842 transitions. [2024-11-08 19:18:14,620 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 842 transitions. Word has length 55 [2024-11-08 19:18:14,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:14,621 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 842 transitions. [2024-11-08 19:18:14,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:14,621 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 842 transitions. [2024-11-08 19:18:14,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 19:18:14,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:14,625 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] [2024-11-08 19:18:14,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:18:14,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:14,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:14,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1961016235, now seen corresponding path program 1 times [2024-11-08 19:18:14,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:14,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186546457] [2024-11-08 19:18:14,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:14,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:14,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:14,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186546457] [2024-11-08 19:18:14,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186546457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:14,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:14,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:14,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645071185] [2024-11-08 19:18:14,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:14,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:14,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:14,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:14,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:14,847 INFO L87 Difference]: Start difference. First operand 565 states and 842 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:14,904 INFO L93 Difference]: Finished difference Result 1086 states and 1619 transitions. [2024-11-08 19:18:14,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:14,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-08 19:18:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:14,908 INFO L225 Difference]: With dead ends: 1086 [2024-11-08 19:18:14,908 INFO L226 Difference]: Without dead ends: 575 [2024-11-08 19:18:14,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:14,911 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 8 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:14,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3252 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-11-08 19:18:14,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2024-11-08 19:18:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 574 states have (on average 1.4912891986062717) internal successors, (856), 574 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:14,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 856 transitions. [2024-11-08 19:18:14,928 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 856 transitions. Word has length 56 [2024-11-08 19:18:14,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:14,929 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 856 transitions. [2024-11-08 19:18:14,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:14,929 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 856 transitions. [2024-11-08 19:18:14,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 19:18:14,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:14,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:14,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:18:14,934 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:14,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:14,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1905932752, now seen corresponding path program 1 times [2024-11-08 19:18:14,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:14,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305235810] [2024-11-08 19:18:14,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:14,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:15,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:15,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:15,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305235810] [2024-11-08 19:18:15,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305235810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:15,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:15,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 19:18:15,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649579076] [2024-11-08 19:18:15,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:15,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:18:15,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:15,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:18:15,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:18:15,768 INFO L87 Difference]: Start difference. First operand 575 states and 856 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:16,051 INFO L93 Difference]: Finished difference Result 1106 states and 1646 transitions. [2024-11-08 19:18:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 19:18:16,051 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-08 19:18:16,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:16,054 INFO L225 Difference]: With dead ends: 1106 [2024-11-08 19:18:16,054 INFO L226 Difference]: Without dead ends: 585 [2024-11-08 19:18:16,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-08 19:18:16,056 INFO L432 NwaCegarLoop]: 800 mSDtfsCounter, 809 mSDsluCounter, 5583 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 6383 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:16,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 6383 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:18:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-08 19:18:16,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 582. [2024-11-08 19:18:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 1.4905335628227194) internal successors, (866), 581 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 866 transitions. [2024-11-08 19:18:16,069 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 866 transitions. Word has length 57 [2024-11-08 19:18:16,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:16,070 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 866 transitions. [2024-11-08 19:18:16,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:16,070 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 866 transitions. [2024-11-08 19:18:16,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 19:18:16,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:16,071 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:16,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:18:16,072 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:16,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:16,072 INFO L85 PathProgramCache]: Analyzing trace with hash 977767518, now seen corresponding path program 1 times [2024-11-08 19:18:16,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:16,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242270858] [2024-11-08 19:18:16,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:16,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:16,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:16,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:16,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242270858] [2024-11-08 19:18:16,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242270858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:16,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:16,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:18:16,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29177544] [2024-11-08 19:18:16,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:16,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:18:16,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:16,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:18:16,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:18:16,454 INFO L87 Difference]: Start difference. First operand 582 states and 866 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:16,548 INFO L93 Difference]: Finished difference Result 1112 states and 1655 transitions. [2024-11-08 19:18:16,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:16,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-08 19:18:16,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:16,552 INFO L225 Difference]: With dead ends: 1112 [2024-11-08 19:18:16,553 INFO L226 Difference]: Without dead ends: 584 [2024-11-08 19:18:16,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:16,556 INFO L432 NwaCegarLoop]: 812 mSDtfsCounter, 789 mSDsluCounter, 2420 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 3232 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:16,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 3232 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-11-08 19:18:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2024-11-08 19:18:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 583 states have (on average 1.4888507718696398) internal successors, (868), 583 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 868 transitions. [2024-11-08 19:18:16,572 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 868 transitions. Word has length 57 [2024-11-08 19:18:16,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:16,573 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 868 transitions. [2024-11-08 19:18:16,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:16,573 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 868 transitions. [2024-11-08 19:18:16,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 19:18:16,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:16,574 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] [2024-11-08 19:18:16,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:18:16,574 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:16,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:16,578 INFO L85 PathProgramCache]: Analyzing trace with hash 166135954, now seen corresponding path program 1 times [2024-11-08 19:18:16,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:16,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823662793] [2024-11-08 19:18:16,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:16,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:16,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:16,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823662793] [2024-11-08 19:18:16,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823662793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:16,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:16,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:18:16,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636398643] [2024-11-08 19:18:16,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:16,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:18:16,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:16,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:18:16,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:18:16,896 INFO L87 Difference]: Start difference. First operand 584 states and 868 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:17,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:17,053 INFO L93 Difference]: Finished difference Result 1323 states and 1962 transitions. [2024-11-08 19:18:17,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:18:17,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-11-08 19:18:17,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:17,058 INFO L225 Difference]: With dead ends: 1323 [2024-11-08 19:18:17,058 INFO L226 Difference]: Without dead ends: 793 [2024-11-08 19:18:17,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:18:17,060 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 1359 mSDsluCounter, 2404 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 3209 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:17,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 3209 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:17,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2024-11-08 19:18:17,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 588. [2024-11-08 19:18:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 1.4889267461669506) internal successors, (874), 587 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 874 transitions. [2024-11-08 19:18:17,076 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 874 transitions. Word has length 58 [2024-11-08 19:18:17,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:17,076 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 874 transitions. [2024-11-08 19:18:17,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 874 transitions. [2024-11-08 19:18:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 19:18:17,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:17,077 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] [2024-11-08 19:18:17,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:18:17,078 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:17,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:17,078 INFO L85 PathProgramCache]: Analyzing trace with hash 518918581, now seen corresponding path program 1 times [2024-11-08 19:18:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:17,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315760855] [2024-11-08 19:18:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:17,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:18:17,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:18:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:18:17,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:18:17,307 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:18:17,308 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:18:17,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 19:18:17,315 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:17,403 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:18:17,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:18:17 BoogieIcfgContainer [2024-11-08 19:18:17,407 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:18:17,408 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:18:17,409 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:18:17,409 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:18:17,409 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:18:11" (3/4) ... [2024-11-08 19:18:17,412 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:18:17,413 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:18:17,414 INFO L158 Benchmark]: Toolchain (without parser) took 9694.03ms. Allocated memory was 180.4MB in the beginning and 434.1MB in the end (delta: 253.8MB). Free memory was 109.2MB in the beginning and 129.6MB in the end (delta: -20.4MB). Peak memory consumption was 236.5MB. Max. memory is 16.1GB. [2024-11-08 19:18:17,415 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 180.4MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:18:17,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 773.11ms. Allocated memory is still 180.4MB. Free memory was 109.0MB in the beginning and 119.9MB in the end (delta: -11.0MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-11-08 19:18:17,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 286.22ms. Allocated memory is still 180.4MB. Free memory was 119.0MB in the beginning and 68.7MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-08 19:18:17,417 INFO L158 Benchmark]: Boogie Preprocessor took 466.99ms. Allocated memory was 180.4MB in the beginning and 306.2MB in the end (delta: 125.8MB). Free memory was 68.7MB in the beginning and 236.5MB in the end (delta: -167.7MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. [2024-11-08 19:18:17,417 INFO L158 Benchmark]: RCFGBuilder took 2667.83ms. Allocated memory is still 306.2MB. Free memory was 236.5MB in the beginning and 193.9MB in the end (delta: 42.5MB). Peak memory consumption was 112.2MB. Max. memory is 16.1GB. [2024-11-08 19:18:17,417 INFO L158 Benchmark]: TraceAbstraction took 5486.64ms. Allocated memory was 306.2MB in the beginning and 434.1MB in the end (delta: 127.9MB). Free memory was 192.9MB in the beginning and 130.6MB in the end (delta: 62.3MB). Peak memory consumption was 190.2MB. Max. memory is 16.1GB. [2024-11-08 19:18:17,417 INFO L158 Benchmark]: Witness Printer took 4.96ms. Allocated memory is still 434.1MB. Free memory was 130.6MB in the beginning and 129.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:18:17,418 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.16ms. Allocated memory is still 180.4MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 773.11ms. Allocated memory is still 180.4MB. Free memory was 109.0MB in the beginning and 119.9MB in the end (delta: -11.0MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 286.22ms. Allocated memory is still 180.4MB. Free memory was 119.0MB in the beginning and 68.7MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 466.99ms. Allocated memory was 180.4MB in the beginning and 306.2MB in the end (delta: 125.8MB). Free memory was 68.7MB in the beginning and 236.5MB in the end (delta: -167.7MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2667.83ms. Allocated memory is still 306.2MB. Free memory was 236.5MB in the beginning and 193.9MB in the end (delta: 42.5MB). Peak memory consumption was 112.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5486.64ms. Allocated memory was 306.2MB in the beginning and 434.1MB in the end (delta: 127.9MB). Free memory was 192.9MB in the beginning and 130.6MB in the end (delta: 62.3MB). Peak memory consumption was 190.2MB. Max. memory is 16.1GB. * Witness Printer took 4.96ms. Allocated memory is still 434.1MB. Free memory was 130.6MB in the beginning and 129.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 189, overapproximation of bitwiseAnd at line 194. 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_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 3); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (3 - 1); [L38] const SORT_18 mask_SORT_18 = (SORT_18)-1 >> (sizeof(SORT_18) * 8 - 2); [L39] const SORT_18 msb_SORT_18 = (SORT_18)1 << (2 - 1); [L41] const SORT_84 mask_SORT_84 = (SORT_84)-1 >> (sizeof(SORT_84) * 8 - 4); [L42] const SORT_84 msb_SORT_84 = (SORT_84)1 << (4 - 1); [L44] const SORT_148 mask_SORT_148 = (SORT_148)-1 >> (sizeof(SORT_148) * 8 - 32); [L45] const SORT_148 msb_SORT_148 = (SORT_148)1 << (32 - 1); [L47] const SORT_5 var_7 = 0; [L48] const SORT_10 var_12 = 3; [L49] const SORT_10 var_15 = 1; [L50] const SORT_10 var_24 = 0; [L51] const SORT_1 var_28 = 0; [L52] const SORT_3 var_30 = 0; [L53] const SORT_1 var_38 = 1; [L54] const SORT_10 var_62 = 2; [L55] const SORT_10 var_70 = 4; [L56] const SORT_10 var_72 = 5; [L57] const SORT_10 var_100 = 7; [L58] const SORT_10 var_105 = 6; [L59] const SORT_148 var_150 = 0; [L60] const SORT_3 var_165 = 2; [L61] const SORT_3 var_187 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_176; [L67] SORT_3 input_177; [L68] SORT_3 input_178; [L69] SORT_3 input_186; [L70] SORT_3 input_195; [L71] SORT_3 input_196; [L72] SORT_3 input_197; [L73] SORT_3 input_200; [L74] SORT_3 input_219; [L75] SORT_3 input_220; [L76] SORT_3 input_221; [L77] SORT_3 input_224; [L78] SORT_3 input_226; [L79] SORT_18 input_240; [L80] SORT_18 input_241; [L81] SORT_18 input_242; [L83] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L83] SORT_5 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L84] SORT_10 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L85] SORT_3 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L86] SORT_3 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L87] SORT_3 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L88] SORT_1 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L89] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L90] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L91] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L92] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L93] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L94] SORT_3 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L95] SORT_3 state_60 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] SORT_5 init_9_arg_1 = var_7; [L98] state_8 = init_9_arg_1 [L99] SORT_10 init_26_arg_1 = var_24; [L100] state_25 = init_26_arg_1 [L101] SORT_3 init_32_arg_1 = var_30; [L102] state_31 = init_32_arg_1 [L103] SORT_3 init_43_arg_1 = var_30; [L104] state_42 = init_43_arg_1 [L105] SORT_3 init_45_arg_1 = var_30; [L106] state_44 = init_45_arg_1 [L107] SORT_1 init_47_arg_1 = var_28; [L108] state_46 = init_47_arg_1 [L109] SORT_3 init_49_arg_1 = var_30; [L110] state_48 = init_49_arg_1 [L111] SORT_3 init_51_arg_1 = var_30; [L112] state_50 = init_51_arg_1 [L113] SORT_3 init_53_arg_1 = var_30; [L114] state_52 = init_53_arg_1 [L115] SORT_3 init_55_arg_1 = var_30; [L116] state_54 = init_55_arg_1 [L117] SORT_3 init_57_arg_1 = var_30; [L118] state_56 = init_57_arg_1 [L119] SORT_3 init_59_arg_1 = var_30; [L120] state_58 = init_59_arg_1 [L121] SORT_3 init_61_arg_1 = var_30; [L122] state_60 = init_61_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_176 = __VERIFIER_nondet_uchar() [L129] input_177 = __VERIFIER_nondet_uchar() [L130] input_178 = __VERIFIER_nondet_uchar() [L131] input_186 = __VERIFIER_nondet_uchar() [L132] input_195 = __VERIFIER_nondet_uchar() [L133] input_196 = __VERIFIER_nondet_uchar() [L134] input_197 = __VERIFIER_nondet_uchar() [L135] input_200 = __VERIFIER_nondet_uchar() [L136] input_219 = __VERIFIER_nondet_uchar() [L137] input_220 = __VERIFIER_nondet_uchar() [L138] input_221 = __VERIFIER_nondet_uchar() [L139] input_224 = __VERIFIER_nondet_uchar() [L140] input_226 = __VERIFIER_nondet_uchar() [L141] input_240 = __VERIFIER_nondet_uchar() [L142] input_241 = __VERIFIER_nondet_uchar() [L143] input_242 = __VERIFIER_nondet_uchar() [L146] SORT_5 var_11_arg_0 = state_8; [L147] SORT_10 var_11 = var_11_arg_0 >> 9; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L148] EXPR var_11 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L148] var_11 = var_11 & mask_SORT_10 [L149] SORT_10 var_13_arg_0 = var_11; [L150] SORT_10 var_13_arg_1 = var_12; [L151] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L152] SORT_5 var_14_arg_0 = state_8; [L153] SORT_10 var_14 = var_14_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L154] EXPR var_14 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L154] var_14 = var_14 & mask_SORT_10 [L155] SORT_10 var_16_arg_0 = var_14; [L156] SORT_10 var_16_arg_1 = var_15; [L157] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L158] SORT_1 var_17_arg_0 = var_13; [L159] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17_arg_0=0, var_17_arg_1=0, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L160] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L160] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L161] SORT_5 var_19_arg_0 = state_8; [L162] SORT_18 var_19 = var_19_arg_0 >> 7; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17=0, var_187=31, var_19=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L163] EXPR var_19 & mask_SORT_18 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17=0, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L163] var_19 = var_19 & mask_SORT_18 [L164] SORT_5 var_20_arg_0 = state_8; [L165] SORT_18 var_20 = var_20_arg_0 >> 5; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17=0, var_187=31, var_19=0, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L166] EXPR var_20 & mask_SORT_18 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17=0, var_187=31, var_19=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L166] var_20 = var_20 & mask_SORT_18 [L167] SORT_18 var_21_arg_0 = var_19; [L168] SORT_18 var_21_arg_1 = var_20; [L169] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L170] SORT_1 var_22_arg_0 = var_17; [L171] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_22_arg_0=0, var_22_arg_1=1, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L172] EXPR var_22_arg_0 & var_22_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L172] SORT_1 var_22 = var_22_arg_0 & var_22_arg_1; [L173] SORT_1 var_23_arg_0 = var_22; [L174] SORT_1 var_23 = ~var_23_arg_0; [L175] SORT_10 var_27_arg_0 = state_25; [L176] SORT_1 var_27 = var_27_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_23=-1, var_24=0, var_27=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L177] EXPR var_27 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_23=-1, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L177] var_27 = var_27 & mask_SORT_1 [L178] SORT_1 var_29_arg_0 = var_27; [L179] SORT_1 var_29_arg_1 = var_28; [L180] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L181] SORT_3 var_33_arg_0 = state_31; [L182] SORT_3 var_33_arg_1 = var_30; [L183] SORT_1 var_33 = var_33_arg_0 == var_33_arg_1; [L184] SORT_1 var_34_arg_0 = var_29; [L185] SORT_1 var_34_arg_1 = var_33; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_23=-1, var_24=0, var_28=0, var_30=0, var_34_arg_0=1, var_34_arg_1=1, var_38=1, var_62=2, var_70=4, var_72=5] [L186] EXPR var_34_arg_0 | var_34_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_23=-1, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L186] SORT_1 var_34 = var_34_arg_0 | var_34_arg_1; [L187] SORT_1 var_35_arg_0 = var_23; [L188] SORT_1 var_35_arg_1 = var_34; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_35_arg_0=-1, var_35_arg_1=1, var_38=1, var_62=2, var_70=4, var_72=5] [L189] EXPR var_35_arg_0 | var_35_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L189] SORT_1 var_35 = var_35_arg_0 | var_35_arg_1; [L190] SORT_1 var_39_arg_0 = var_35; [L191] SORT_1 var_39 = ~var_39_arg_0; [L192] SORT_1 var_40_arg_0 = var_38; [L193] SORT_1 var_40_arg_1 = var_39; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_40_arg_0=1, var_40_arg_1=-1, var_62=2, var_70=4, var_72=5] [L194] EXPR var_40_arg_0 & var_40_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L194] SORT_1 var_40 = var_40_arg_0 & var_40_arg_1; [L195] EXPR var_40 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L195] var_40 = var_40 & mask_SORT_1 [L196] SORT_1 bad_41_arg_0 = var_40; [L197] CALL __VERIFIER_assert(!(bad_41_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 551 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2975 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2975 mSDsluCounter, 25813 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20135 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 384 IncrementalHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 5678 mSDtfsCounter, 384 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=588occurred in iteration=7, InterpolantAutomatonStates: 42, 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, 7 MinimizatonAttempts, 209 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 448 NumberOfCodeBlocks, 448 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 841 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-11-08 19:18:17,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ad777bd82b2fbfc07486a835bf99ca2e475906af4a3b134d048b1c18acbc93b4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:18:19,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:18:19,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 19:18:19,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:18:19,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:18:19,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:18:19,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:18:19,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:18:19,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:18:19,939 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:18:19,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:18:19,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:18:19,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:18:19,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:18:19,943 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:18:19,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:18:19,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:18:19,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:18:19,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:18:19,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:18:19,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:18:19,949 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:18:19,950 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:18:19,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:18:19,951 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:18:19,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:18:19,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:18:19,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:18:19,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:18:19,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:18:19,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:18:19,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:18:19,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:18:19,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:18:19,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:18:19,954 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:18:19,954 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:18:19,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:18:19,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:18:19,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:18:19,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:18:19,956 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad777bd82b2fbfc07486a835bf99ca2e475906af4a3b134d048b1c18acbc93b4 [2024-11-08 19:18:20,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:18:20,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:18:20,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:18:20,349 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:18:20,349 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:18:20,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-11-08 19:18:22,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:18:22,332 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:18:22,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-11-08 19:18:22,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8b4bd0e/c5e64333eb0049ac9e32bd88cd9d960a/FLAGb50ed4d00 [2024-11-08 19:18:22,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8b4bd0e/c5e64333eb0049ac9e32bd88cd9d960a [2024-11-08 19:18:22,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:18:22,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:18:22,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:18:22,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:18:22,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:18:22,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:18:22" (1/1) ... [2024-11-08 19:18:22,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7db79be5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:22, skipping insertion in model container [2024-11-08 19:18:22,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:18:22" (1/1) ... [2024-11-08 19:18:22,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:18:22,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c[1259,1272] [2024-11-08 19:18:22,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:18:22,931 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:18:22,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c[1259,1272] [2024-11-08 19:18:23,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:18:23,106 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:18:23,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:23 WrapperNode [2024-11-08 19:18:23,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:18:23,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:18:23,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:18:23,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:18:23,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:23" (1/1) ... [2024-11-08 19:18:23,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:23" (1/1) ... [2024-11-08 19:18:23,255 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1091 [2024-11-08 19:18:23,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:18:23,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:18:23,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:18:23,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:18:23,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:23" (1/1) ... [2024-11-08 19:18:23,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:23" (1/1) ... [2024-11-08 19:18:23,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:23" (1/1) ... [2024-11-08 19:18:23,327 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:18:23,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:23" (1/1) ... [2024-11-08 19:18:23,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:23" (1/1) ... [2024-11-08 19:18:23,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:23" (1/1) ... [2024-11-08 19:18:23,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:23" (1/1) ... [2024-11-08 19:18:23,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:23" (1/1) ... [2024-11-08 19:18:23,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:23" (1/1) ... [2024-11-08 19:18:23,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:18:23,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:18:23,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:18:23,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:18:23,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:23" (1/1) ... [2024-11-08 19:18:23,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:18:23,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:18:23,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:18:23,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:18:23,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:18:23,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:18:23,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:18:23,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:18:23,755 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:18:23,757 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:18:25,219 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2024-11-08 19:18:25,220 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:18:25,231 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:18:25,233 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:18:25,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:18:25 BoogieIcfgContainer [2024-11-08 19:18:25,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:18:25,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:18:25,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:18:25,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:18:25,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:18:22" (1/3) ... [2024-11-08 19:18:25,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba57c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:18:25, skipping insertion in model container [2024-11-08 19:18:25,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:23" (2/3) ... [2024-11-08 19:18:25,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba57c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:18:25, skipping insertion in model container [2024-11-08 19:18:25,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:18:25" (3/3) ... [2024-11-08 19:18:25,244 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-11-08 19:18:25,261 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:18:25,262 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:18:25,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:18:25,329 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;@1df4198c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:18:25,330 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:18:25,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:25,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 19:18:25,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:25,338 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 19:18:25,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:25,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:25,343 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 19:18:25,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:18:25,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633175399] [2024-11-08 19:18:25,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:25,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:18:25,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:18:25,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:18:25,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 19:18:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:25,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 19:18:25,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:18:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:25,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:18:25,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:18:25,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633175399] [2024-11-08 19:18:25,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633175399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:25,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:25,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:18:25,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803093750] [2024-11-08 19:18:25,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:25,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:18:25,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:18:25,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:18:25,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:18:25,951 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:26,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:26,041 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-08 19:18:26,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:18:26,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-08 19:18:26,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:26,050 INFO L225 Difference]: With dead ends: 18 [2024-11-08 19:18:26,051 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 19:18:26,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:26,057 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:26,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:26,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 19:18:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 19:18:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 19:18:26,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 19:18:26,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:26,089 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 19:18:26,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:26,089 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 19:18:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 19:18:26,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:26,090 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:26,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 19:18:26,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:18:26,291 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:26,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:26,292 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-08 19:18:26,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:18:26,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145116483] [2024-11-08 19:18:26,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:26,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:18:26,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:18:26,295 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:18:26,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 19:18:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:26,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 19:18:26,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:18:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:27,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:18:32,354 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_25~0#1|)) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse4 (forall ((|v_ULTIMATE.start_main_~var_40_arg_0~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_35_arg_0~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_34_arg_1~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_40_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_34_arg_1~0#1_10|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_35_arg_0~0#1_10|))))))))))))))) (.cse1 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_28~0#1|)) (.cse0 (forall ((|v_ULTIMATE.start_main_~var_40_arg_0~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_35_arg_0~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_34_arg_1~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_40_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_34_arg_1~0#1_10|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_35_arg_0~0#1_10|))))))))))))))) (.cse5 (= ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_70~0#1|) .cse7))) (and (or (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_24~0#1|))))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 8))) (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_10~0#1|) .cse3))) (_ bv2 32))))))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 8))) (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_10~0#1|) .cse3))) (_ bv2 32))))))))) .cse4))) (not .cse5)) (or (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_15~0#1|) .cse7))))))) (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 8))) (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_10~0#1|) .cse6))) (_ bv2 32))))))))) .cse4) (or (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 8))) (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_10~0#1|) .cse6))) (_ bv2 32)))))))))) .cse0))) .cse5)))) is different from false [2024-11-08 19:18:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-08 19:18:32,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:18:32,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145116483] [2024-11-08 19:18:32,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145116483] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:18:32,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:18:32,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-08 19:18:32,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663451789] [2024-11-08 19:18:32,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:18:32,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 19:18:32,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:18:32,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 19:18:32,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-08 19:18:32,868 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:33,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:33,397 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-08 19:18:33,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:18:33,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 8 [2024-11-08 19:18:33,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:33,399 INFO L225 Difference]: With dead ends: 15 [2024-11-08 19:18:33,399 INFO L226 Difference]: Without dead ends: 13 [2024-11-08 19:18:33,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=31, Invalid=44, Unknown=1, NotChecked=14, Total=90 [2024-11-08 19:18:33,400 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:33,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 6 Unchecked, 0.2s Time] [2024-11-08 19:18:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-08 19:18:33,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-08 19:18:33,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:33,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-08 19:18:33,405 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-08 19:18:33,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:33,405 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-08 19:18:33,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:33,405 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-08 19:18:33,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:18:33,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:33,406 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-08 19:18:33,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 19:18:33,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:18:33,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:33,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:33,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-08 19:18:33,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:18:33,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89260231] [2024-11-08 19:18:33,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 19:18:33,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:18:33,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:18:33,617 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:18:33,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 19:18:34,169 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 19:18:34,170 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:18:34,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 19:18:34,198 INFO L278 TraceCheckSpWp]: Computing forward predicates...