./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p4.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 38fe6edef2c4227a551fd0bd2efbb70ffec62fb04544c0cbb381405d275a8737 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:02:03,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:02:03,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 07:02:03,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:02:03,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:02:03,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:02:03,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:02:03,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:02:03,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:02:03,686 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:02:03,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:02:03,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:02:03,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:02:03,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:02:03,688 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:02:03,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:02:03,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:02:03,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:02:03,689 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:02:03,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:02:03,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:02:03,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:02:03,692 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:02:03,692 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:02:03,692 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:02:03,693 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:02:03,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:02:03,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:02:03,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:02:03,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:02:03,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:02:03,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:02:03,694 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:02:03,694 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:02:03,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:02:03,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:02:03,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:02:03,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:02:03,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:02:03,695 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 38fe6edef2c4227a551fd0bd2efbb70ffec62fb04544c0cbb381405d275a8737 [2024-10-11 07:02:03,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:02:03,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:02:03,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:02:03,891 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:02:03,891 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:02:03,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p4.c [2024-10-11 07:02:05,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:02:05,388 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:02:05,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p4.c [2024-10-11 07:02:05,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e658c01c2/56a09fc4f44d405c936ff693600a06a8/FLAGa8541ad0e [2024-10-11 07:02:05,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e658c01c2/56a09fc4f44d405c936ff693600a06a8 [2024-10-11 07:02:05,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:02:05,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:02:05,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:02:05,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:02:05,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:02:05,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:02:05" (1/1) ... [2024-10-11 07:02:05,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c77ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:02:05, skipping insertion in model container [2024-10-11 07:02:05,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:02:05" (1/1) ... [2024-10-11 07:02:05,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:02:05,674 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p4.c[1258,1271] [2024-10-11 07:02:05,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:02:05,952 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:02:05,961 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p4.c[1258,1271] [2024-10-11 07:02:06,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:02:06,088 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:02:06,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:02:06 WrapperNode [2024-10-11 07:02:06,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:02:06,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:02:06,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:02:06,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:02:06,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:02:06" (1/1) ... [2024-10-11 07:02:06,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:02:06" (1/1) ... [2024-10-11 07:02:06,390 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3437 [2024-10-11 07:02:06,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:02:06,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:02:06,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:02:06,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:02:06,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:02:06" (1/1) ... [2024-10-11 07:02:06,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:02:06" (1/1) ... [2024-10-11 07:02:06,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:02:06" (1/1) ... [2024-10-11 07:02:06,569 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:02:06,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:02:06" (1/1) ... [2024-10-11 07:02:06,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:02:06" (1/1) ... [2024-10-11 07:02:06,633 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:02:06" (1/1) ... [2024-10-11 07:02:06,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:02:06" (1/1) ... [2024-10-11 07:02:06,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:02:06" (1/1) ... [2024-10-11 07:02:06,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:02:06" (1/1) ... [2024-10-11 07:02:06,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:02:06,728 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:02:06,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:02:06,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:02:06,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:02:06" (1/1) ... [2024-10-11 07:02:06,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:02:06,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:02:06,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:02:06,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:02:06,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:02:06,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:02:06,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:02:06,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:02:07,082 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:02:07,083 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:02:09,232 INFO L? ?]: Removed 2169 outVars from TransFormulas that were not future-live. [2024-10-11 07:02:09,232 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:02:09,296 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:02:09,296 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:02:09,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:02:09 BoogieIcfgContainer [2024-10-11 07:02:09,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:02:09,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:02:09,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:02:09,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:02:09,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:02:05" (1/3) ... [2024-10-11 07:02:09,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73943a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:02:09, skipping insertion in model container [2024-10-11 07:02:09,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:02:06" (2/3) ... [2024-10-11 07:02:09,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73943a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:02:09, skipping insertion in model container [2024-10-11 07:02:09,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:02:09" (3/3) ... [2024-10-11 07:02:09,303 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_bpbs_p4.c [2024-10-11 07:02:09,316 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:02:09,316 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:02:09,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:02:09,382 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;@623995de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:02:09,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:02:09,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 819 states, 817 states have (on average 1.500611995104039) internal successors, (1226), 818 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 07:02:09,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:02:09,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:02:09,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:02:09,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:02:09,401 INFO L85 PathProgramCache]: Analyzing trace with hash -793895475, now seen corresponding path program 1 times [2024-10-11 07:02:09,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:02:09,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542678746] [2024-10-11 07:02:09,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:02:09,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:02:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:02:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:02:10,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:02:10,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542678746] [2024-10-11 07:02:10,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542678746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:02:10,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:02:10,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:02:10,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193605257] [2024-10-11 07:02:10,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:02:10,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:02:10,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:02:10,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:02:10,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:02:10,257 INFO L87 Difference]: Start difference. First operand has 819 states, 817 states have (on average 1.500611995104039) internal successors, (1226), 818 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:02:10,343 INFO L93 Difference]: Finished difference Result 1570 states and 2352 transitions. [2024-10-11 07:02:10,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:02:10,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-11 07:02:10,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:02:10,357 INFO L225 Difference]: With dead ends: 1570 [2024-10-11 07:02:10,357 INFO L226 Difference]: Without dead ends: 820 [2024-10-11 07:02:10,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:02:10,364 INFO L432 NwaCegarLoop]: 1221 mSDtfsCounter, 0 mSDsluCounter, 2437 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3658 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:02:10,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3658 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:02:10,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2024-10-11 07:02:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 820. [2024-10-11 07:02:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 819 states have (on average 1.496947496947497) internal successors, (1226), 819 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1226 transitions. [2024-10-11 07:02:10,422 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1226 transitions. Word has length 62 [2024-10-11 07:02:10,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:02:10,422 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1226 transitions. [2024-10-11 07:02:10,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1226 transitions. [2024-10-11 07:02:10,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 07:02:10,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:02:10,424 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:02:10,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:02:10,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:02:10,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:02:10,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1160739581, now seen corresponding path program 1 times [2024-10-11 07:02:10,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:02:10,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317569666] [2024-10-11 07:02:10,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:02:10,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:02:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:02:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:02:10,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:02:10,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317569666] [2024-10-11 07:02:10,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317569666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:02:10,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:02:10,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:02:10,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161967926] [2024-10-11 07:02:10,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:02:10,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:02:10,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:02:10,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:02:10,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:02:10,684 INFO L87 Difference]: Start difference. First operand 820 states and 1226 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:10,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:02:10,727 INFO L93 Difference]: Finished difference Result 1573 states and 2352 transitions. [2024-10-11 07:02:10,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:02:10,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-11 07:02:10,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:02:10,730 INFO L225 Difference]: With dead ends: 1573 [2024-10-11 07:02:10,731 INFO L226 Difference]: Without dead ends: 822 [2024-10-11 07:02:10,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:02:10,732 INFO L432 NwaCegarLoop]: 1221 mSDtfsCounter, 0 mSDsluCounter, 2434 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3655 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:02:10,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3655 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:02:10,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-10-11 07:02:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2024-10-11 07:02:10,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 821 states have (on average 1.4957369062119366) internal successors, (1228), 821 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1228 transitions. [2024-10-11 07:02:10,767 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1228 transitions. Word has length 63 [2024-10-11 07:02:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:02:10,767 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1228 transitions. [2024-10-11 07:02:10,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1228 transitions. [2024-10-11 07:02:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 07:02:10,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:02:10,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:02:10,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:02:10,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:02:10,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:02:10,770 INFO L85 PathProgramCache]: Analyzing trace with hash 525223078, now seen corresponding path program 1 times [2024-10-11 07:02:10,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:02:10,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460218810] [2024-10-11 07:02:10,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:02:10,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:02:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:02:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:02:11,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:02:11,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460218810] [2024-10-11 07:02:11,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460218810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:02:11,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:02:11,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:02:11,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15183488] [2024-10-11 07:02:11,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:02:11,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:02:11,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:02:11,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:02:11,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:02:11,098 INFO L87 Difference]: Start difference. First operand 822 states and 1228 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:11,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:02:11,133 INFO L93 Difference]: Finished difference Result 1577 states and 2356 transitions. [2024-10-11 07:02:11,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:02:11,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-11 07:02:11,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:02:11,136 INFO L225 Difference]: With dead ends: 1577 [2024-10-11 07:02:11,136 INFO L226 Difference]: Without dead ends: 824 [2024-10-11 07:02:11,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:02:11,139 INFO L432 NwaCegarLoop]: 1221 mSDtfsCounter, 0 mSDsluCounter, 2434 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3655 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:02:11,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3655 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:02:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-10-11 07:02:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2024-10-11 07:02:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 1.49453219927096) internal successors, (1230), 823 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1230 transitions. [2024-10-11 07:02:11,155 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1230 transitions. Word has length 64 [2024-10-11 07:02:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:02:11,155 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1230 transitions. [2024-10-11 07:02:11,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1230 transitions. [2024-10-11 07:02:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 07:02:11,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:02:11,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:02:11,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:02:11,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:02:11,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:02:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash 10933412, now seen corresponding path program 1 times [2024-10-11 07:02:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:02:11,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880015965] [2024-10-11 07:02:11,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:02:11,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:02:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:02:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:02:11,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:02:11,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880015965] [2024-10-11 07:02:11,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880015965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:02:11,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:02:11,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:02:11,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477935920] [2024-10-11 07:02:11,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:02:11,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:02:11,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:02:11,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:02:11,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:02:11,349 INFO L87 Difference]: Start difference. First operand 824 states and 1230 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:02:11,398 INFO L93 Difference]: Finished difference Result 1585 states and 2366 transitions. [2024-10-11 07:02:11,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:02:11,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-11 07:02:11,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:02:11,401 INFO L225 Difference]: With dead ends: 1585 [2024-10-11 07:02:11,401 INFO L226 Difference]: Without dead ends: 830 [2024-10-11 07:02:11,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:02:11,402 INFO L432 NwaCegarLoop]: 1220 mSDtfsCounter, 4 mSDsluCounter, 3651 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4871 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:02:11,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4871 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:02:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-10-11 07:02:11,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2024-10-11 07:02:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 1.4933655006031363) internal successors, (1238), 829 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1238 transitions. [2024-10-11 07:02:11,416 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1238 transitions. Word has length 65 [2024-10-11 07:02:11,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:02:11,416 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1238 transitions. [2024-10-11 07:02:11,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:11,417 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1238 transitions. [2024-10-11 07:02:11,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 07:02:11,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:02:11,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:02:11,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:02:11,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:02:11,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:02:11,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1184077400, now seen corresponding path program 1 times [2024-10-11 07:02:11,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:02:11,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309500961] [2024-10-11 07:02:11,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:02:11,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:02:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:02:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:02:11,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:02:11,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309500961] [2024-10-11 07:02:11,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309500961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:02:11,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:02:11,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 07:02:11,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81320093] [2024-10-11 07:02:11,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:02:11,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:02:11,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:02:11,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:02:11,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:02:11,677 INFO L87 Difference]: Start difference. First operand 830 states and 1238 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:11,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:02:11,758 INFO L93 Difference]: Finished difference Result 1597 states and 2382 transitions. [2024-10-11 07:02:11,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:02:11,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-11 07:02:11,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:02:11,760 INFO L225 Difference]: With dead ends: 1597 [2024-10-11 07:02:11,760 INFO L226 Difference]: Without dead ends: 836 [2024-10-11 07:02:11,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:02:11,762 INFO L432 NwaCegarLoop]: 1217 mSDtfsCounter, 8 mSDsluCounter, 7285 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8502 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:02:11,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8502 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:02:11,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2024-10-11 07:02:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2024-10-11 07:02:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 835 states have (on average 1.4922155688622754) internal successors, (1246), 835 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1246 transitions. [2024-10-11 07:02:11,773 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1246 transitions. Word has length 66 [2024-10-11 07:02:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:02:11,773 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1246 transitions. [2024-10-11 07:02:11,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1246 transitions. [2024-10-11 07:02:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 07:02:11,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:02:11,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:02:11,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:02:11,775 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:02:11,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:02:11,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1063985266, now seen corresponding path program 1 times [2024-10-11 07:02:11,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:02:11,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447179526] [2024-10-11 07:02:11,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:02:11,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:02:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:02:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:02:12,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:02:12,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447179526] [2024-10-11 07:02:12,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447179526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:02:12,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:02:12,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:02:12,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89289772] [2024-10-11 07:02:12,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:02:12,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:02:12,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:02:12,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:02:12,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:02:12,055 INFO L87 Difference]: Start difference. First operand 836 states and 1246 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:02:12,204 INFO L93 Difference]: Finished difference Result 1609 states and 2398 transitions. [2024-10-11 07:02:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:02:12,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-10-11 07:02:12,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:02:12,210 INFO L225 Difference]: With dead ends: 1609 [2024-10-11 07:02:12,211 INFO L226 Difference]: Without dead ends: 842 [2024-10-11 07:02:12,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:02:12,217 INFO L432 NwaCegarLoop]: 1220 mSDtfsCounter, 4 mSDsluCounter, 3651 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4871 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:02:12,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4871 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:02:12,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2024-10-11 07:02:12,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2024-10-11 07:02:12,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 1.4910820451843043) internal successors, (1254), 841 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1254 transitions. [2024-10-11 07:02:12,232 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1254 transitions. Word has length 67 [2024-10-11 07:02:12,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:02:12,232 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1254 transitions. [2024-10-11 07:02:12,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1254 transitions. [2024-10-11 07:02:12,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 07:02:12,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:02:12,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:02:12,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 07:02:12,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:02:12,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:02:12,235 INFO L85 PathProgramCache]: Analyzing trace with hash 381150474, now seen corresponding path program 1 times [2024-10-11 07:02:12,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:02:12,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844078527] [2024-10-11 07:02:12,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:02:12,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:02:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:02:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:02:12,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:02:12,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844078527] [2024-10-11 07:02:12,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844078527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:02:12,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:02:12,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 07:02:12,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556701577] [2024-10-11 07:02:12,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:02:12,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:02:12,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:02:12,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:02:12,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:02:12,665 INFO L87 Difference]: Start difference. First operand 842 states and 1254 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:12,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:02:12,783 INFO L93 Difference]: Finished difference Result 1747 states and 2596 transitions. [2024-10-11 07:02:12,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:02:12,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-10-11 07:02:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:02:12,786 INFO L225 Difference]: With dead ends: 1747 [2024-10-11 07:02:12,787 INFO L226 Difference]: Without dead ends: 974 [2024-10-11 07:02:12,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:02:12,788 INFO L432 NwaCegarLoop]: 1215 mSDtfsCounter, 1379 mSDsluCounter, 4852 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 6067 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:02:12,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 6067 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:02:12,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-11 07:02:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 921. [2024-10-11 07:02:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.4902173913043477) internal successors, (1371), 920 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:12,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1371 transitions. [2024-10-11 07:02:12,801 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1371 transitions. Word has length 68 [2024-10-11 07:02:12,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:02:12,801 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1371 transitions. [2024-10-11 07:02:12,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:02:12,802 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1371 transitions. [2024-10-11 07:02:12,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 07:02:12,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:02:12,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:02:12,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 07:02:12,804 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:02:12,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:02:12,805 INFO L85 PathProgramCache]: Analyzing trace with hash -77623756, now seen corresponding path program 1 times [2024-10-11 07:02:12,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:02:12,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873531788] [2024-10-11 07:02:12,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:02:12,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:02:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:02:12,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:02:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:02:12,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:02:12,972 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:02:12,973 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:02:12,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 07:02:12,977 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:02:13,040 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:02:13,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:02:13 BoogieIcfgContainer [2024-10-11 07:02:13,042 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:02:13,043 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:02:13,043 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:02:13,043 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:02:13,044 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:02:09" (3/4) ... [2024-10-11 07:02:13,045 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 07:02:13,112 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 07:02:13,114 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:02:13,115 INFO L158 Benchmark]: Toolchain (without parser) took 7686.72ms. Allocated memory was 182.5MB in the beginning and 817.9MB in the end (delta: 635.4MB). Free memory was 151.2MB in the beginning and 369.1MB in the end (delta: -217.9MB). Peak memory consumption was 416.0MB. Max. memory is 16.1GB. [2024-10-11 07:02:13,115 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:02:13,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 659.09ms. Allocated memory is still 182.5MB. Free memory was 151.2MB in the beginning and 130.1MB in the end (delta: 21.1MB). Peak memory consumption was 78.4MB. Max. memory is 16.1GB. [2024-10-11 07:02:13,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 300.85ms. Allocated memory is still 182.5MB. Free memory was 130.1MB in the beginning and 89.5MB in the end (delta: 40.6MB). Peak memory consumption was 91.9MB. Max. memory is 16.1GB. [2024-10-11 07:02:13,115 INFO L158 Benchmark]: Boogie Preprocessor took 336.25ms. Allocated memory was 182.5MB in the beginning and 333.4MB in the end (delta: 151.0MB). Free memory was 89.5MB in the beginning and 209.7MB in the end (delta: -120.2MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2024-10-11 07:02:13,116 INFO L158 Benchmark]: RCFGBuilder took 2568.76ms. Allocated memory was 333.4MB in the beginning and 574.6MB in the end (delta: 241.2MB). Free memory was 209.7MB in the beginning and 361.4MB in the end (delta: -151.7MB). Peak memory consumption was 109.7MB. Max. memory is 16.1GB. [2024-10-11 07:02:13,116 INFO L158 Benchmark]: TraceAbstraction took 3743.82ms. Allocated memory was 574.6MB in the beginning and 817.9MB in the end (delta: 243.3MB). Free memory was 360.4MB in the beginning and 379.6MB in the end (delta: -19.2MB). Peak memory consumption was 222.0MB. Max. memory is 16.1GB. [2024-10-11 07:02:13,116 INFO L158 Benchmark]: Witness Printer took 71.40ms. Allocated memory is still 817.9MB. Free memory was 379.6MB in the beginning and 369.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 07:02:13,117 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.14ms. Allocated memory is still 134.2MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 659.09ms. Allocated memory is still 182.5MB. Free memory was 151.2MB in the beginning and 130.1MB in the end (delta: 21.1MB). Peak memory consumption was 78.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 300.85ms. Allocated memory is still 182.5MB. Free memory was 130.1MB in the beginning and 89.5MB in the end (delta: 40.6MB). Peak memory consumption was 91.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 336.25ms. Allocated memory was 182.5MB in the beginning and 333.4MB in the end (delta: 151.0MB). Free memory was 89.5MB in the beginning and 209.7MB in the end (delta: -120.2MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * RCFGBuilder took 2568.76ms. Allocated memory was 333.4MB in the beginning and 574.6MB in the end (delta: 241.2MB). Free memory was 209.7MB in the beginning and 361.4MB in the end (delta: -151.7MB). Peak memory consumption was 109.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3743.82ms. Allocated memory was 574.6MB in the beginning and 817.9MB in the end (delta: 243.3MB). Free memory was 360.4MB in the beginning and 379.6MB in the end (delta: -19.2MB). Peak memory consumption was 222.0MB. Max. memory is 16.1GB. * Witness Printer took 71.40ms. Allocated memory is still 817.9MB. Free memory was 379.6MB in the beginning and 369.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 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 - 2); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (2 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 4); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (4 - 1); [L35] const SORT_66 mask_SORT_66 = (SORT_66)-1 >> (sizeof(SORT_66) * 8 - 32); [L36] const SORT_66 msb_SORT_66 = (SORT_66)1 << (32 - 1); [L38] const SORT_100 mask_SORT_100 = (SORT_100)-1 >> (sizeof(SORT_100) * 8 - 3); [L39] const SORT_100 msb_SORT_100 = (SORT_100)1 << (3 - 1); [L41] const SORT_10 var_12 = 15; [L42] const SORT_1 var_16 = 1; [L43] const SORT_3 var_22 = 0; [L44] const SORT_1 var_25 = 0; [L45] const SORT_66 var_68 = 1; [L46] const SORT_3 var_106 = 3; [L47] const SORT_66 var_115 = 2; [L48] const SORT_66 var_122 = 0; [L50] SORT_1 input_2; [L51] SORT_3 input_4; [L52] SORT_3 input_5; [L53] SORT_1 input_6; [L54] SORT_3 input_7; [L55] SORT_1 input_8; [L56] SORT_1 input_9; [L57] SORT_1 input_90; [L58] SORT_3 input_105; [L59] SORT_3 input_127; [L60] SORT_3 input_128; [L61] SORT_3 input_129; [L62] SORT_3 input_137; [L63] SORT_3 input_139; [L64] SORT_3 input_141; [L65] SORT_3 input_167; [L66] SORT_3 input_168; [L67] SORT_3 input_176; [L68] SORT_3 input_178; [L69] SORT_3 input_180; [L70] SORT_3 input_182; [L71] SORT_3 input_236; [L72] SORT_3 input_245; [L73] SORT_3 input_246; [L74] SORT_3 input_247; [L75] SORT_3 input_248; [L76] SORT_3 input_273; [L77] SORT_3 input_274; [L78] SORT_3 input_275; [L79] SORT_3 input_284; [L80] SORT_3 input_330; [L81] SORT_3 input_340; [L82] SORT_3 input_341; [L83] SORT_3 input_342; [L84] SORT_3 input_343; [L85] SORT_3 input_352; [L86] SORT_3 input_371; [L87] SORT_3 input_372; [L88] SORT_3 input_373; [L89] SORT_3 input_382; [L90] SORT_3 input_384; [L91] SORT_3 input_430; [L92] SORT_3 input_441; [L93] SORT_3 input_442; [L94] SORT_3 input_443; [L95] SORT_3 input_444; [L96] SORT_3 input_453; [L97] SORT_3 input_455; [L98] SORT_3 input_475; [L99] SORT_3 input_476; [L100] SORT_3 input_477; [L101] SORT_3 input_486; [L102] SORT_3 input_488; [L103] SORT_3 input_490; [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L105] SORT_10 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L106] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L106] SORT_3 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L107] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L107] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L108] SORT_3 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L109] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L109] SORT_3 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L110] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L110] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L111] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L111] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L112] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L112] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L113] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L113] SORT_3 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L114] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L114] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L115] SORT_3 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L116] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L117] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L118] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L119] SORT_3 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L120] SORT_3 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L121] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L121] SORT_3 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L125] input_2 = __VERIFIER_nondet_uchar() [L126] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L126] input_2 = input_2 & mask_SORT_1 [L127] input_4 = __VERIFIER_nondet_uchar() [L128] input_5 = __VERIFIER_nondet_uchar() [L129] input_6 = __VERIFIER_nondet_uchar() [L130] input_7 = __VERIFIER_nondet_uchar() [L131] input_8 = __VERIFIER_nondet_uchar() [L132] input_9 = __VERIFIER_nondet_uchar() [L133] EXPR input_9 & mask_SORT_1 VAL [input_2=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L133] input_9 = input_9 & mask_SORT_1 [L134] input_90 = __VERIFIER_nondet_uchar() [L135] input_105 = __VERIFIER_nondet_uchar() [L136] input_127 = __VERIFIER_nondet_uchar() [L137] input_128 = __VERIFIER_nondet_uchar() [L138] input_129 = __VERIFIER_nondet_uchar() [L139] input_137 = __VERIFIER_nondet_uchar() [L140] input_139 = __VERIFIER_nondet_uchar() [L141] input_141 = __VERIFIER_nondet_uchar() [L142] input_167 = __VERIFIER_nondet_uchar() [L143] input_168 = __VERIFIER_nondet_uchar() [L144] input_176 = __VERIFIER_nondet_uchar() [L145] input_178 = __VERIFIER_nondet_uchar() [L146] input_180 = __VERIFIER_nondet_uchar() [L147] input_182 = __VERIFIER_nondet_uchar() [L148] input_236 = __VERIFIER_nondet_uchar() [L149] input_245 = __VERIFIER_nondet_uchar() [L150] input_246 = __VERIFIER_nondet_uchar() [L151] input_247 = __VERIFIER_nondet_uchar() [L152] input_248 = __VERIFIER_nondet_uchar() [L153] input_273 = __VERIFIER_nondet_uchar() [L154] input_274 = __VERIFIER_nondet_uchar() [L155] input_275 = __VERIFIER_nondet_uchar() [L156] input_284 = __VERIFIER_nondet_uchar() [L157] input_330 = __VERIFIER_nondet_uchar() [L158] input_340 = __VERIFIER_nondet_uchar() [L159] input_341 = __VERIFIER_nondet_uchar() [L160] input_342 = __VERIFIER_nondet_uchar() [L161] input_343 = __VERIFIER_nondet_uchar() [L162] input_352 = __VERIFIER_nondet_uchar() [L163] input_371 = __VERIFIER_nondet_uchar() [L164] input_372 = __VERIFIER_nondet_uchar() [L165] input_373 = __VERIFIER_nondet_uchar() [L166] input_382 = __VERIFIER_nondet_uchar() [L167] input_384 = __VERIFIER_nondet_uchar() [L168] input_430 = __VERIFIER_nondet_uchar() [L169] input_441 = __VERIFIER_nondet_uchar() [L170] input_442 = __VERIFIER_nondet_uchar() [L171] input_443 = __VERIFIER_nondet_uchar() [L172] input_444 = __VERIFIER_nondet_uchar() [L173] input_453 = __VERIFIER_nondet_uchar() [L174] input_455 = __VERIFIER_nondet_uchar() [L175] input_475 = __VERIFIER_nondet_uchar() [L176] input_476 = __VERIFIER_nondet_uchar() [L177] input_477 = __VERIFIER_nondet_uchar() [L178] input_486 = __VERIFIER_nondet_uchar() [L179] input_488 = __VERIFIER_nondet_uchar() [L180] input_490 = __VERIFIER_nondet_uchar() [L183] SORT_10 var_13_arg_0 = state_11; [L184] SORT_10 var_13_arg_1 = var_12; [L185] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L186] SORT_1 var_20_arg_0 = var_16; [L187] SORT_3 var_20_arg_1 = state_19; [L188] SORT_3 var_20_arg_2 = state_18; [L189] SORT_3 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L190] SORT_1 var_17_arg_0 = var_16; [L191] SORT_3 var_17_arg_1 = state_15; [L192] SORT_3 var_17_arg_2 = state_14; [L193] SORT_3 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; [L194] SORT_1 var_21_arg_0 = var_16; [L195] SORT_3 var_21_arg_1 = var_20; [L196] SORT_3 var_21_arg_2 = var_17; [L197] SORT_3 var_21 = var_21_arg_0 ? var_21_arg_1 : var_21_arg_2; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_13=1, var_16=1, var_21=0, var_22=0, var_25=0, var_68=1] [L198] EXPR var_21 & mask_SORT_3 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_13=1, var_16=1, var_22=0, var_25=0, var_68=1] [L198] var_21 = var_21 & mask_SORT_3 [L199] SORT_3 var_23_arg_0 = var_21; [L200] SORT_3 var_23_arg_1 = var_22; [L201] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L202] SORT_1 var_24_arg_0 = var_13; [L203] SORT_1 var_24_arg_1 = var_23; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_24_arg_0=1, var_24_arg_1=1, var_25=0, var_68=1] [L204] EXPR var_24_arg_0 & var_24_arg_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L204] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L205] SORT_1 var_27_arg_0 = var_25; [L206] SORT_3 var_27_arg_1 = state_19; [L207] SORT_3 var_27_arg_2 = state_18; [L208] SORT_3 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L209] SORT_1 var_26_arg_0 = var_25; [L210] SORT_3 var_26_arg_1 = state_15; [L211] SORT_3 var_26_arg_2 = state_14; [L212] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L213] SORT_1 var_28_arg_0 = var_16; [L214] SORT_3 var_28_arg_1 = var_27; [L215] SORT_3 var_28_arg_2 = var_26; [L216] SORT_3 var_28 = var_28_arg_0 ? var_28_arg_1 : var_28_arg_2; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_24=1, var_25=0, var_28=0, var_68=1] [L217] EXPR var_28 & mask_SORT_3 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_24=1, var_25=0, var_68=1] [L217] var_28 = var_28 & mask_SORT_3 [L218] SORT_3 var_29_arg_0 = var_28; [L219] SORT_3 var_29_arg_1 = var_22; [L220] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L221] SORT_1 var_30_arg_0 = var_24; [L222] SORT_1 var_30_arg_1 = var_29; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_30_arg_0=1, var_30_arg_1=1, var_68=1] [L223] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L223] SORT_1 var_30 = var_30_arg_0 & var_30_arg_1; [L224] SORT_1 var_32_arg_0 = var_16; [L225] SORT_3 var_32_arg_1 = state_19; [L226] SORT_3 var_32_arg_2 = state_18; [L227] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L228] SORT_1 var_31_arg_0 = var_16; [L229] SORT_3 var_31_arg_1 = state_15; [L230] SORT_3 var_31_arg_2 = state_14; [L231] SORT_3 var_31 = var_31_arg_0 ? var_31_arg_1 : var_31_arg_2; [L232] SORT_1 var_33_arg_0 = var_25; [L233] SORT_3 var_33_arg_1 = var_32; [L234] SORT_3 var_33_arg_2 = var_31; [L235] SORT_3 var_33 = var_33_arg_0 ? var_33_arg_1 : var_33_arg_2; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_30=1, var_33=0, var_68=1] [L236] EXPR var_33 & mask_SORT_3 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_30=1, var_68=1] [L236] var_33 = var_33 & mask_SORT_3 [L237] SORT_3 var_34_arg_0 = var_33; [L238] SORT_3 var_34_arg_1 = var_22; [L239] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L240] SORT_1 var_35_arg_0 = var_30; [L241] SORT_1 var_35_arg_1 = var_34; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_35_arg_0=1, var_35_arg_1=1, var_68=1] [L242] EXPR var_35_arg_0 & var_35_arg_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L242] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L243] SORT_1 var_37_arg_0 = var_25; [L244] SORT_3 var_37_arg_1 = state_19; [L245] SORT_3 var_37_arg_2 = state_18; [L246] SORT_3 var_37 = var_37_arg_0 ? var_37_arg_1 : var_37_arg_2; [L247] SORT_1 var_36_arg_0 = var_25; [L248] SORT_3 var_36_arg_1 = state_15; [L249] SORT_3 var_36_arg_2 = state_14; [L250] SORT_3 var_36 = var_36_arg_0 ? var_36_arg_1 : var_36_arg_2; [L251] SORT_1 var_38_arg_0 = var_25; [L252] SORT_3 var_38_arg_1 = var_37; [L253] SORT_3 var_38_arg_2 = var_36; [L254] SORT_3 var_38 = var_38_arg_0 ? var_38_arg_1 : var_38_arg_2; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_35=1, var_38=0, var_68=1] [L255] EXPR var_38 & mask_SORT_3 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_35=1, var_68=1] [L255] var_38 = var_38 & mask_SORT_3 [L256] SORT_3 var_39_arg_0 = var_38; [L257] SORT_3 var_39_arg_1 = var_22; [L258] SORT_1 var_39 = var_39_arg_0 == var_39_arg_1; [L259] SORT_1 var_40_arg_0 = var_35; [L260] SORT_1 var_40_arg_1 = var_39; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_40_arg_0=1, var_40_arg_1=1, var_68=1] [L261] EXPR var_40_arg_0 & var_40_arg_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L261] SORT_1 var_40 = var_40_arg_0 & var_40_arg_1; [L262] SORT_1 var_41_arg_0 = var_40; [L263] SORT_1 var_41 = ~var_41_arg_0; [L264] SORT_1 var_44_arg_0 = var_41; [L265] SORT_1 var_44 = ~var_44_arg_0; [L266] SORT_1 var_45_arg_0 = var_16; [L267] SORT_1 var_45_arg_1 = var_44; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_45_arg_0=1, var_45_arg_1=-255, var_68=1] [L268] EXPR var_45_arg_0 & var_45_arg_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L268] SORT_1 var_45 = var_45_arg_0 & var_45_arg_1; [L269] EXPR var_45 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L269] var_45 = var_45 & mask_SORT_1 [L270] SORT_1 bad_46_arg_0 = var_45; [L271] CALL __VERIFIER_assert(!(bad_46_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 819 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1395 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1395 mSDsluCounter, 35279 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26744 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 209 IncrementalHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 8535 mSDtfsCounter, 209 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=921occurred in iteration=7, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 53 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 524 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 448 ConstructedInterpolants, 0 QuantifiedInterpolants, 777 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 proved your program to be incorrect! [2024-10-11 07:02:13,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE