./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6556ff515d0922dbe3a06bc5063ec9f60439b7c3554b3a4149c1075ac229d4f7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:05:51,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:05:51,825 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 19:05:51,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:05:51,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:05:51,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:05:51,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:05:51,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:05:51,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:05:51,855 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:05:51,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:05:51,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:05:51,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:05:51,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:05:51,858 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:05:51,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:05:51,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:05:51,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:05:51,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:05:51,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:05:51,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:05:51,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:05:51,862 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:05:51,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:05:51,862 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:05:51,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:05:51,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:05:51,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:05:51,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:05:51,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:05:51,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:05:51,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:05:51,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:05:51,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:05:51,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:05:51,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:05:51,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:05:51,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:05:51,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:05:51,865 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6556ff515d0922dbe3a06bc5063ec9f60439b7c3554b3a4149c1075ac229d4f7 [2024-11-08 19:05:52,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:05:52,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:05:52,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:05:52,114 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:05:52,114 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:05:52,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2024-11-08 19:05:53,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:05:53,447 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:05:53,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2024-11-08 19:05:53,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8552fb54/4fd6f328774f4c97a5654bb635a4e2aa/FLAG8c667724f [2024-11-08 19:05:53,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8552fb54/4fd6f328774f4c97a5654bb635a4e2aa [2024-11-08 19:05:53,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:05:53,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:05:53,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:05:53,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:05:53,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:05:53,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:05:53" (1/1) ... [2024-11-08 19:05:53,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12978e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:53, skipping insertion in model container [2024-11-08 19:05:53,472 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:05:53" (1/1) ... [2024-11-08 19:05:53,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:05:53,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c[1247,1260] [2024-11-08 19:05:53,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:05:53,638 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:05:53,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c[1247,1260] [2024-11-08 19:05:53,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:05:53,678 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:05:53,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:53 WrapperNode [2024-11-08 19:05:53,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:05:53,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:05:53,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:05:53,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:05:53,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:53" (1/1) ... [2024-11-08 19:05:53,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:53" (1/1) ... [2024-11-08 19:05:53,727 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 144 [2024-11-08 19:05:53,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:05:53,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:05:53,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:05:53,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:05:53,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:53" (1/1) ... [2024-11-08 19:05:53,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:53" (1/1) ... [2024-11-08 19:05:53,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:53" (1/1) ... [2024-11-08 19:05:53,752 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:05:53,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:53" (1/1) ... [2024-11-08 19:05:53,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:53" (1/1) ... [2024-11-08 19:05:53,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:53" (1/1) ... [2024-11-08 19:05:53,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:53" (1/1) ... [2024-11-08 19:05:53,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:53" (1/1) ... [2024-11-08 19:05:53,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:53" (1/1) ... [2024-11-08 19:05:53,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:05:53,768 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:05:53,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:05:53,768 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:05:53,769 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:53" (1/1) ... [2024-11-08 19:05:53,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:05:53,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:05:53,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:05:53,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:05:53,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:05:53,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:05:53,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:05:53,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:05:53,894 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:05:53,896 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:05:54,164 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-11-08 19:05:54,164 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:05:54,174 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:05:54,177 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:05:54,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:05:54 BoogieIcfgContainer [2024-11-08 19:05:54,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:05:54,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:05:54,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:05:54,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:05:54,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:05:53" (1/3) ... [2024-11-08 19:05:54,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ff96af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:05:54, skipping insertion in model container [2024-11-08 19:05:54,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:53" (2/3) ... [2024-11-08 19:05:54,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ff96af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:05:54, skipping insertion in model container [2024-11-08 19:05:54,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:05:54" (3/3) ... [2024-11-08 19:05:54,186 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.synabs2.c [2024-11-08 19:05:54,198 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:05:54,199 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:05:54,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:05:54,287 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;@7c4a3324, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:05:54,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:05:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:54,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 19:05:54,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:54,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:54,300 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:54,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:54,306 INFO L85 PathProgramCache]: Analyzing trace with hash -829897697, now seen corresponding path program 1 times [2024-11-08 19:05:54,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:54,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766264494] [2024-11-08 19:05:54,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:54,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:05:54,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:54,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766264494] [2024-11-08 19:05:54,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766264494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:54,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:54,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:05:54,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936165293] [2024-11-08 19:05:54,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:54,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:05:54,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:54,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:05:54,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:05:54,659 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 0 states have call successors, (0), 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 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:54,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:54,698 INFO L93 Difference]: Finished difference Result 73 states and 105 transitions. [2024-11-08 19:05:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:05:54,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 19:05:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:54,707 INFO L225 Difference]: With dead ends: 73 [2024-11-08 19:05:54,707 INFO L226 Difference]: Without dead ends: 41 [2024-11-08 19:05:54,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:05:54,711 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:54,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:05:54,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-08 19:05:54,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-08 19:05:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2024-11-08 19:05:54,734 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 13 [2024-11-08 19:05:54,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:54,734 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2024-11-08 19:05:54,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2024-11-08 19:05:54,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:05:54,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:54,735 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:54,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:05:54,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:54,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:54,736 INFO L85 PathProgramCache]: Analyzing trace with hash 44670374, now seen corresponding path program 1 times [2024-11-08 19:05:54,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:54,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258868523] [2024-11-08 19:05:54,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:54,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:05:54,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:54,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258868523] [2024-11-08 19:05:54,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258868523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:54,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:54,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:05:54,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87612589] [2024-11-08 19:05:54,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:54,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:05:54,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:54,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:05:54,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:05:54,854 INFO L87 Difference]: Start difference. First operand 41 states and 57 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:54,876 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2024-11-08 19:05:54,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:05:54,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-08 19:05:54,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:54,877 INFO L225 Difference]: With dead ends: 74 [2024-11-08 19:05:54,877 INFO L226 Difference]: Without dead ends: 43 [2024-11-08 19:05:54,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:05:54,879 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:54,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:05:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-08 19:05:54,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-08 19:05:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:54,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2024-11-08 19:05:54,882 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 14 [2024-11-08 19:05:54,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:54,882 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2024-11-08 19:05:54,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2024-11-08 19:05:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 19:05:54,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:54,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:54,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:05:54,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:54,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:54,884 INFO L85 PathProgramCache]: Analyzing trace with hash 286815704, now seen corresponding path program 1 times [2024-11-08 19:05:54,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:54,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594005661] [2024-11-08 19:05:54,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:54,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:05:55,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:55,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594005661] [2024-11-08 19:05:55,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594005661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:55,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:55,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:05:55,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487749234] [2024-11-08 19:05:55,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:55,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:05:55,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:55,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:05:55,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:05:55,022 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:55,052 INFO L93 Difference]: Finished difference Result 74 states and 102 transitions. [2024-11-08 19:05:55,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:05:55,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-08 19:05:55,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:55,054 INFO L225 Difference]: With dead ends: 74 [2024-11-08 19:05:55,054 INFO L226 Difference]: Without dead ends: 41 [2024-11-08 19:05:55,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:05:55,055 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 50 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:55,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 97 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:05:55,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-08 19:05:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-08 19:05:55,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2024-11-08 19:05:55,060 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 15 [2024-11-08 19:05:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:55,061 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2024-11-08 19:05:55,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2024-11-08 19:05:55,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 19:05:55,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:55,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:55,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:05:55,062 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:55,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:55,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1865897385, now seen corresponding path program 1 times [2024-11-08 19:05:55,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:55,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418397526] [2024-11-08 19:05:55,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:55,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:05:55,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:05:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:05:55,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:05:55,111 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:05:55,112 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:05:55,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:05:55,116 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 19:05:55,139 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:05:55,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:05:55 BoogieIcfgContainer [2024-11-08 19:05:55,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:05:55,146 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:05:55,146 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:05:55,146 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:05:55,147 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:05:54" (3/4) ... [2024-11-08 19:05:55,149 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:05:55,149 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:05:55,150 INFO L158 Benchmark]: Toolchain (without parser) took 1684.10ms. Allocated memory is still 184.5MB. Free memory was 146.1MB in the beginning and 58.4MB in the end (delta: 87.8MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2024-11-08 19:05:55,150 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 117.4MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:05:55,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.01ms. Allocated memory is still 184.5MB. Free memory was 146.1MB in the beginning and 132.5MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 19:05:55,151 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.29ms. Allocated memory is still 184.5MB. Free memory was 132.5MB in the beginning and 128.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:05:55,152 INFO L158 Benchmark]: Boogie Preprocessor took 38.44ms. Allocated memory is still 184.5MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:05:55,152 INFO L158 Benchmark]: RCFGBuilder took 410.84ms. Allocated memory is still 184.5MB. Free memory was 126.2MB in the beginning and 103.2MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 19:05:55,152 INFO L158 Benchmark]: TraceAbstraction took 965.24ms. Allocated memory is still 184.5MB. Free memory was 102.1MB in the beginning and 59.4MB in the end (delta: 42.7MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2024-11-08 19:05:55,155 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 184.5MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:05:55,156 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.08ms. Allocated memory is still 117.4MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.01ms. Allocated memory is still 184.5MB. Free memory was 146.1MB in the beginning and 132.5MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.29ms. Allocated memory is still 184.5MB. Free memory was 132.5MB in the beginning and 128.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.44ms. Allocated memory is still 184.5MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 410.84ms. Allocated memory is still 184.5MB. Free memory was 126.2MB in the beginning and 103.2MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 965.24ms. Allocated memory is still 184.5MB. Free memory was 102.1MB in the beginning and 59.4MB in the end (delta: 42.7MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 184.5MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 63. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 5); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (5 - 1); [L32] const SORT_19 mask_SORT_19 = (SORT_19)-1 >> (sizeof(SORT_19) * 8 - 32); [L33] const SORT_19 msb_SORT_19 = (SORT_19)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_4 var_8 = 6; [L37] const SORT_1 var_14 = 1; [L38] const SORT_19 var_21 = 2; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=31, var_14=1, var_21=2, var_5=0, var_8=6] [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=31, var_14=1, var_21=2, var_5=0, var_8=6] [L44] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L46] SORT_4 init_7_arg_1 = var_5; [L47] state_6 = init_7_arg_1 [L48] SORT_4 init_10_arg_1 = var_8; [L49] state_9 = init_10_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_16_arg_0=1, var_16_arg_1=-2, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 399 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 244 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 155 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 80 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 19:05:55,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6556ff515d0922dbe3a06bc5063ec9f60439b7c3554b3a4149c1075ac229d4f7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:05:56,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:05:56,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 19:05:56,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:05:56,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:05:57,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:05:57,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:05:57,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:05:57,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:05:57,024 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:05:57,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:05:57,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:05:57,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:05:57,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:05:57,025 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:05:57,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:05:57,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:05:57,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:05:57,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:05:57,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:05:57,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:05:57,029 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:05:57,029 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:05:57,030 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:05:57,030 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:05:57,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:05:57,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:05:57,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:05:57,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:05:57,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:05:57,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:05:57,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:05:57,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:05:57,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:05:57,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:05:57,033 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:05:57,033 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:05:57,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:05:57,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:05:57,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:05:57,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:05:57,035 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6556ff515d0922dbe3a06bc5063ec9f60439b7c3554b3a4149c1075ac229d4f7 [2024-11-08 19:05:57,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:05:57,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:05:57,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:05:57,314 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:05:57,315 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:05:57,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2024-11-08 19:05:58,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:05:58,690 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:05:58,690 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2024-11-08 19:05:58,697 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8604b5c2f/53f2aeb2e38b48039953a1de48ed3c8f/FLAGa847d48fc [2024-11-08 19:05:59,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8604b5c2f/53f2aeb2e38b48039953a1de48ed3c8f [2024-11-08 19:05:59,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:05:59,083 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:05:59,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:05:59,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:05:59,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:05:59,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:05:59" (1/1) ... [2024-11-08 19:05:59,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2794a1db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:59, skipping insertion in model container [2024-11-08 19:05:59,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:05:59" (1/1) ... [2024-11-08 19:05:59,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:05:59,244 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c[1247,1260] [2024-11-08 19:05:59,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:05:59,288 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:05:59,298 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c[1247,1260] [2024-11-08 19:05:59,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:05:59,337 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:05:59,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:59 WrapperNode [2024-11-08 19:05:59,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:05:59,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:05:59,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:05:59,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:05:59,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:59" (1/1) ... [2024-11-08 19:05:59,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:59" (1/1) ... [2024-11-08 19:05:59,376 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2024-11-08 19:05:59,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:05:59,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:05:59,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:05:59,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:05:59,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:59" (1/1) ... [2024-11-08 19:05:59,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:59" (1/1) ... [2024-11-08 19:05:59,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:59" (1/1) ... [2024-11-08 19:05:59,400 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:05:59,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:59" (1/1) ... [2024-11-08 19:05:59,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:59" (1/1) ... [2024-11-08 19:05:59,410 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:59" (1/1) ... [2024-11-08 19:05:59,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:59" (1/1) ... [2024-11-08 19:05:59,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:59" (1/1) ... [2024-11-08 19:05:59,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:59" (1/1) ... [2024-11-08 19:05:59,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:05:59,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:05:59,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:05:59,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:05:59,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:59" (1/1) ... [2024-11-08 19:05:59,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:05:59,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:05:59,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:05:59,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:05:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:05:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:05:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:05:59,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:05:59,562 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:05:59,564 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:05:59,712 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 19:05:59,713 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:05:59,725 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:05:59,726 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:05:59,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:05:59 BoogieIcfgContainer [2024-11-08 19:05:59,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:05:59,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:05:59,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:05:59,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:05:59,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:05:59" (1/3) ... [2024-11-08 19:05:59,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8e5800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:05:59, skipping insertion in model container [2024-11-08 19:05:59,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:59" (2/3) ... [2024-11-08 19:05:59,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8e5800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:05:59, skipping insertion in model container [2024-11-08 19:05:59,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:05:59" (3/3) ... [2024-11-08 19:05:59,734 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.synabs2.c [2024-11-08 19:05:59,748 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:05:59,748 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:05:59,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:05:59,804 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;@4fb221c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:05:59,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:05:59,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:59,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 19:05:59,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:59,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 19:05:59,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:59,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:59,821 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 19:05:59,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:05:59,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848328369] [2024-11-08 19:05:59,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:59,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:05:59,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:05:59,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:05:59,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 19:05:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:59,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 19:05:59,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:06:00,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:06:00,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:06:00,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:06:00,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848328369] [2024-11-08 19:06:00,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848328369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:06:00,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:06:00,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:06:00,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330533165] [2024-11-08 19:06:00,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:06:00,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:06:00,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:06:00,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:06:00,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:06:00,126 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:06:00,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:06:00,162 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-08 19:06:00,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:06:00,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-08 19:06:00,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:06:00,169 INFO L225 Difference]: With dead ends: 18 [2024-11-08 19:06:00,169 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 19:06:00,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:06:00,174 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:06:00,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:06:00,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 19:06:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 19:06:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:06:00,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 19:06:00,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 19:06:00,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:06:00,196 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 19:06:00,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:06:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 19:06:00,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 19:06:00,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:06:00,196 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 19:06:00,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 19:06:00,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:06:00,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:06:00,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:06:00,400 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-08 19:06:00,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:06:00,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172452472] [2024-11-08 19:06:00,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:06:00,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:06:00,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:06:00,403 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:06:00,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 19:06:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:06:00,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 19:06:00,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:06:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:06:00,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:06:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:06:00,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:06:00,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172452472] [2024-11-08 19:06:00,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172452472] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:06:00,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:06:00,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-08 19:06:00,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597630658] [2024-11-08 19:06:00,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:06:00,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 19:06:00,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:06:00,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 19:06:00,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:06:00,814 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:06:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:06:00,959 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-08 19:06:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:06:00,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-08 19:06:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:06:00,960 INFO L225 Difference]: With dead ends: 18 [2024-11-08 19:06:00,960 INFO L226 Difference]: Without dead ends: 16 [2024-11-08 19:06:00,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:06:00,962 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:06:00,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:06:00,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-08 19:06:00,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-08 19:06:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:06:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-08 19:06:00,968 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-08 19:06:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:06:00,969 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-08 19:06:00,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:06:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-08 19:06:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:06:00,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:06:00,970 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-08 19:06:00,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 19:06:01,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:06:01,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:06:01,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:06:01,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-08 19:06:01,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:06:01,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157134336] [2024-11-08 19:06:01,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 19:06:01,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:06:01,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:06:01,176 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:06:01,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 19:06:01,231 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 19:06:01,231 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:06:01,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 19:06:01,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:06:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:06:01,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:06:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:06:01,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:06:01,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157134336] [2024-11-08 19:06:01,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157134336] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:06:01,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:06:01,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-08 19:06:01,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766544632] [2024-11-08 19:06:01,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:06:01,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 19:06:01,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:06:01,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 19:06:01,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:06:01,842 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:06:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:06:02,412 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-08 19:06:02,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 19:06:02,413 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-08 19:06:02,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:06:02,413 INFO L225 Difference]: With dead ends: 30 [2024-11-08 19:06:02,413 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 19:06:02,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2024-11-08 19:06:02,415 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:06:02,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:06:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 19:06:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-08 19:06:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:06:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-08 19:06:02,420 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-11-08 19:06:02,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:06:02,420 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-08 19:06:02,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:06:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-08 19:06:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 19:06:02,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:06:02,420 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2024-11-08 19:06:02,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 19:06:02,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:06:02,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:06:02,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:06:02,624 INFO L85 PathProgramCache]: Analyzing trace with hash 96933411, now seen corresponding path program 3 times [2024-11-08 19:06:02,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:06:02,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651943113] [2024-11-08 19:06:02,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 19:06:02,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:06:02,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:06:02,627 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:06:02,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 19:06:02,713 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-08 19:06:02,714 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:06:02,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 19:06:02,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:06:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:06:03,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:06:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:06:04,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:06:04,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651943113] [2024-11-08 19:06:04,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651943113] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:06:04,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:06:04,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-11-08 19:06:04,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479566397] [2024-11-08 19:06:04,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:06:04,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 19:06:04,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:06:04,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 19:06:04,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2024-11-08 19:06:04,257 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:06:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:06:05,886 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2024-11-08 19:06:05,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 19:06:05,886 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-08 19:06:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:06:05,887 INFO L225 Difference]: With dead ends: 48 [2024-11-08 19:06:05,887 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 19:06:05,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=392, Invalid=1014, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 19:06:05,889 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:06:05,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:06:05,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 19:06:05,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-11-08 19:06:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:06:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2024-11-08 19:06:05,896 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 26 [2024-11-08 19:06:05,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:06:05,897 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2024-11-08 19:06:05,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:06:05,897 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2024-11-08 19:06:05,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 19:06:05,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:06:05,898 INFO L215 NwaCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1] [2024-11-08 19:06:05,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 19:06:06,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:06:06,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:06:06,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:06:06,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1558545309, now seen corresponding path program 4 times [2024-11-08 19:06:06,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:06:06,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139475354] [2024-11-08 19:06:06,100 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 19:06:06,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:06:06,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:06:06,101 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:06:06,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 19:06:06,227 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 19:06:06,227 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-08 19:06:06,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:06:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:06:06,365 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-08 19:06:06,365 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:06:06,366 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:06:06,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-08 19:06:06,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:06:06,570 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1] [2024-11-08 19:06:06,611 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:06:06,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:06:06 BoogieIcfgContainer [2024-11-08 19:06:06,613 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:06:06,614 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:06:06,614 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:06:06,614 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:06:06,615 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:05:59" (3/4) ... [2024-11-08 19:06:06,615 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 19:06:06,688 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 19:06:06,688 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:06:06,688 INFO L158 Benchmark]: Toolchain (without parser) took 7605.25ms. Allocated memory was 62.9MB in the beginning and 151.0MB in the end (delta: 88.1MB). Free memory was 39.8MB in the beginning and 56.6MB in the end (delta: -16.8MB). Peak memory consumption was 75.1MB. Max. memory is 16.1GB. [2024-11-08 19:06:06,688 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 62.9MB. Free memory was 40.0MB in the beginning and 39.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:06:06,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.11ms. Allocated memory is still 62.9MB. Free memory was 39.6MB in the beginning and 25.8MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 19:06:06,689 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.37ms. Allocated memory is still 86.0MB. Free memory was 66.5MB in the beginning and 64.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:06:06,689 INFO L158 Benchmark]: Boogie Preprocessor took 42.25ms. Allocated memory is still 86.0MB. Free memory was 64.9MB in the beginning and 63.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:06:06,689 INFO L158 Benchmark]: RCFGBuilder took 302.85ms. Allocated memory is still 86.0MB. Free memory was 63.1MB in the beginning and 49.8MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 19:06:06,689 INFO L158 Benchmark]: TraceAbstraction took 6885.19ms. Allocated memory was 86.0MB in the beginning and 151.0MB in the end (delta: 65.0MB). Free memory was 49.3MB in the beginning and 66.1MB in the end (delta: -16.7MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2024-11-08 19:06:06,689 INFO L158 Benchmark]: Witness Printer took 74.02ms. Allocated memory is still 151.0MB. Free memory was 66.1MB in the beginning and 56.6MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 19:06:06,694 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.15ms. Allocated memory is still 62.9MB. Free memory was 40.0MB in the beginning and 39.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.11ms. Allocated memory is still 62.9MB. Free memory was 39.6MB in the beginning and 25.8MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.37ms. Allocated memory is still 86.0MB. Free memory was 66.5MB in the beginning and 64.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.25ms. Allocated memory is still 86.0MB. Free memory was 64.9MB in the beginning and 63.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 302.85ms. Allocated memory is still 86.0MB. Free memory was 63.1MB in the beginning and 49.8MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6885.19ms. Allocated memory was 86.0MB in the beginning and 151.0MB in the end (delta: 65.0MB). Free memory was 49.3MB in the beginning and 66.1MB in the end (delta: -16.7MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * Witness Printer took 74.02ms. Allocated memory is still 151.0MB. Free memory was 66.1MB in the beginning and 56.6MB in the end (delta: 9.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_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 5); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (5 - 1); [L32] const SORT_19 mask_SORT_19 = (SORT_19)-1 >> (sizeof(SORT_19) * 8 - 32); [L33] const SORT_19 msb_SORT_19 = (SORT_19)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_4 var_8 = 6; [L37] const SORT_1 var_14 = 1; [L38] const SORT_19 var_21 = 2; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L46] SORT_4 init_7_arg_1 = var_5; [L47] state_6 = init_7_arg_1 [L48] SORT_4 init_10_arg_1 = var_8; [L49] state_9 = init_10_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 359 IncrementalHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 16 mSDtfsCounter, 359 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=4, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 94 ConstructedInterpolants, 36 QuantifiedInterpolants, 7926 SizeOfPredicates, 18 NumberOfNonLiveVariables, 310 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 19:06:06,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE