./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_FIFO.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_FIFO.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 d34a336c538fc3840e4ea3ff0e6a49a015ced8c6fe61188192176428c4598a52 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:38:50,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:38:50,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 23:38:50,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:38:50,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:38:50,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:38:50,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:38:50,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:38:50,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:38:50,967 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:38:50,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:38:50,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:38:50,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:38:50,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:38:50,969 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:38:50,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:38:50,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:38:50,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:38:50,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:38:50,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:38:50,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:38:50,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:38:50,975 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:38:50,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:38:50,976 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:38:50,976 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:38:50,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:38:50,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:38:50,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:38:50,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:38:50,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:38:50,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:38:50,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:38:50,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:38:50,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:38:50,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:38:50,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:38:50,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:38:50,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:38:50,978 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 -> d34a336c538fc3840e4ea3ff0e6a49a015ced8c6fe61188192176428c4598a52 [2024-10-12 23:38:51,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:38:51,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:38:51,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:38:51,207 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:38:51,207 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:38:51,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_FIFO.c [2024-10-12 23:38:52,395 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:38:52,587 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:38:52,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_FIFO.c [2024-10-12 23:38:52,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57150b97/ce38f9d43ad24ee7ab63cff37f3acfa7/FLAGeea0e89df [2024-10-12 23:38:52,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57150b97/ce38f9d43ad24ee7ab63cff37f3acfa7 [2024-10-12 23:38:52,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:38:52,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:38:52,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:38:52,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:38:52,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:38:52,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:38:52" (1/1) ... [2024-10-12 23:38:52,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f019b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:52, skipping insertion in model container [2024-10-12 23:38:52,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:38:52" (1/1) ... [2024-10-12 23:38:53,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:38:53,156 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_FIFO.c[1246,1259] [2024-10-12 23:38:53,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:38:53,322 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:38:53,330 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_FIFO.c[1246,1259] [2024-10-12 23:38:53,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:38:53,444 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:38:53,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:53 WrapperNode [2024-10-12 23:38:53,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:38:53,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:38:53,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:38:53,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:38:53,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:53" (1/1) ... [2024-10-12 23:38:53,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:53" (1/1) ... [2024-10-12 23:38:53,679 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1934 [2024-10-12 23:38:53,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:38:53,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:38:53,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:38:53,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:38:53,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:53" (1/1) ... [2024-10-12 23:38:53,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:53" (1/1) ... [2024-10-12 23:38:53,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:53" (1/1) ... [2024-10-12 23:38:53,786 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 23:38:53,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:53" (1/1) ... [2024-10-12 23:38:53,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:53" (1/1) ... [2024-10-12 23:38:53,839 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:53" (1/1) ... [2024-10-12 23:38:53,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:53" (1/1) ... [2024-10-12 23:38:53,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:53" (1/1) ... [2024-10-12 23:38:53,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:53" (1/1) ... [2024-10-12 23:38:53,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:38:53,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:38:53,942 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:38:53,942 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:38:53,943 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:53" (1/1) ... [2024-10-12 23:38:53,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:38:53,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:38:53,968 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-10-12 23:38:53,971 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-10-12 23:38:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:38:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:38:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:38:54,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:38:54,238 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:38:54,240 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:38:55,638 INFO L? ?]: Removed 1109 outVars from TransFormulas that were not future-live. [2024-10-12 23:38:55,638 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:38:55,681 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:38:55,681 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:38:55,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:38:55 BoogieIcfgContainer [2024-10-12 23:38:55,682 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:38:55,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:38:55,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:38:55,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:38:55,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:38:52" (1/3) ... [2024-10-12 23:38:55,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc041b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:38:55, skipping insertion in model container [2024-10-12 23:38:55,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:53" (2/3) ... [2024-10-12 23:38:55,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc041b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:38:55, skipping insertion in model container [2024-10-12 23:38:55,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:38:55" (3/3) ... [2024-10-12 23:38:55,688 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.v_FIFO.c [2024-10-12 23:38:55,703 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:38:55,703 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:38:55,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:38:55,763 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;@65752541, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:38:55,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:38:55,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 535 states, 533 states have (on average 1.5009380863039399) internal successors, (800), 534 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:38:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 23:38:55,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:55,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:38:55,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:55,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:55,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1079001844, now seen corresponding path program 1 times [2024-10-12 23:38:55,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:55,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652624663] [2024-10-12 23:38:55,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:55,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:56,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:56,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652624663] [2024-10-12 23:38:56,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652624663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:38:56,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:38:56,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:38:56,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068477866] [2024-10-12 23:38:56,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:38:56,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:38:56,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:56,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:38:56,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:38:56,719 INFO L87 Difference]: Start difference. First operand has 535 states, 533 states have (on average 1.5009380863039399) internal successors, (800), 534 states have internal predecessors, (800), 0 states have call successors, (0), 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 17.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:38:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:56,831 INFO L93 Difference]: Finished difference Result 1008 states and 1509 transitions. [2024-10-12 23:38:56,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:38:56,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-12 23:38:56,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:56,849 INFO L225 Difference]: With dead ends: 1008 [2024-10-12 23:38:56,850 INFO L226 Difference]: Without dead ends: 534 [2024-10-12 23:38:56,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:38:56,858 INFO L432 NwaCegarLoop]: 785 mSDtfsCounter, 737 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:56,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 1569 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:38:56,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-10-12 23:38:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2024-10-12 23:38:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.4934333958724202) internal successors, (796), 533 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:38:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 796 transitions. [2024-10-12 23:38:56,906 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 796 transitions. Word has length 68 [2024-10-12 23:38:56,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:56,906 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 796 transitions. [2024-10-12 23:38:56,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:38:56,907 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 796 transitions. [2024-10-12 23:38:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-12 23:38:56,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:56,912 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:38:56,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:38:56,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:56,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:56,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1793733935, now seen corresponding path program 1 times [2024-10-12 23:38:56,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:56,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717979609] [2024-10-12 23:38:56,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:56,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:57,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:57,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:57,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717979609] [2024-10-12 23:38:57,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717979609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:38:57,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:38:57,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:38:57,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363093728] [2024-10-12 23:38:57,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:38:57,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:38:57,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:57,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:38:57,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:38:57,281 INFO L87 Difference]: Start difference. First operand 534 states and 796 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:38:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:57,313 INFO L93 Difference]: Finished difference Result 538 states and 800 transitions. [2024-10-12 23:38:57,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:38:57,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-10-12 23:38:57,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:57,316 INFO L225 Difference]: With dead ends: 538 [2024-10-12 23:38:57,317 INFO L226 Difference]: Without dead ends: 536 [2024-10-12 23:38:57,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:38:57,319 INFO L432 NwaCegarLoop]: 793 mSDtfsCounter, 0 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:57,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2374 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:38:57,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-10-12 23:38:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2024-10-12 23:38:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.4915887850467289) internal successors, (798), 535 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:38:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 798 transitions. [2024-10-12 23:38:57,339 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 798 transitions. Word has length 70 [2024-10-12 23:38:57,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:57,340 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 798 transitions. [2024-10-12 23:38:57,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:38:57,340 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 798 transitions. [2024-10-12 23:38:57,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 23:38:57,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:57,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:38:57,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:38:57,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:57,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:57,342 INFO L85 PathProgramCache]: Analyzing trace with hash 230518432, now seen corresponding path program 1 times [2024-10-12 23:38:57,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:57,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089264480] [2024-10-12 23:38:57,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:57,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:58,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:58,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089264480] [2024-10-12 23:38:58,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089264480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:38:58,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:38:58,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:38:58,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855113757] [2024-10-12 23:38:58,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:38:58,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:38:58,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:58,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:38:58,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:38:58,008 INFO L87 Difference]: Start difference. First operand 536 states and 798 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:38:58,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:58,104 INFO L93 Difference]: Finished difference Result 1142 states and 1696 transitions. [2024-10-12 23:38:58,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:38:58,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-12 23:38:58,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:58,107 INFO L225 Difference]: With dead ends: 1142 [2024-10-12 23:38:58,107 INFO L226 Difference]: Without dead ends: 667 [2024-10-12 23:38:58,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:38:58,108 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 1141 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:58,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 2323 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:38:58,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-10-12 23:38:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 542. [2024-10-12 23:38:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.489833641404806) internal successors, (806), 541 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:38:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 806 transitions. [2024-10-12 23:38:58,117 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 806 transitions. Word has length 71 [2024-10-12 23:38:58,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:58,117 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 806 transitions. [2024-10-12 23:38:58,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:38:58,118 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 806 transitions. [2024-10-12 23:38:58,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 23:38:58,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:58,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:38:58,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 23:38:58,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:58,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:58,123 INFO L85 PathProgramCache]: Analyzing trace with hash 350372046, now seen corresponding path program 1 times [2024-10-12 23:38:58,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:58,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609716305] [2024-10-12 23:38:58,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:58,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:58,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:58,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609716305] [2024-10-12 23:38:58,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609716305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:38:58,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:38:58,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:38:58,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375517275] [2024-10-12 23:38:58,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:38:58,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:38:58,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:58,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:38:58,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:38:58,332 INFO L87 Difference]: Start difference. First operand 542 states and 806 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:38:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:58,740 INFO L93 Difference]: Finished difference Result 1410 states and 2099 transitions. [2024-10-12 23:38:58,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 23:38:58,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2024-10-12 23:38:58,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:58,745 INFO L225 Difference]: With dead ends: 1410 [2024-10-12 23:38:58,745 INFO L226 Difference]: Without dead ends: 546 [2024-10-12 23:38:58,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 23:38:58,748 INFO L432 NwaCegarLoop]: 754 mSDtfsCounter, 509 mSDsluCounter, 2821 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 3575 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:58,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 3575 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 23:38:58,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-10-12 23:38:58,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2024-10-12 23:38:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 1.4880294659300184) internal successors, (808), 543 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:38:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 808 transitions. [2024-10-12 23:38:58,761 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 808 transitions. Word has length 72 [2024-10-12 23:38:58,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:58,762 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 808 transitions. [2024-10-12 23:38:58,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:38:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 808 transitions. [2024-10-12 23:38:58,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-12 23:38:58,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:58,764 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:38:58,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 23:38:58,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:58,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:58,765 INFO L85 PathProgramCache]: Analyzing trace with hash 760164067, now seen corresponding path program 1 times [2024-10-12 23:38:58,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:58,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781173933] [2024-10-12 23:38:58,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:58,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:59,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:59,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781173933] [2024-10-12 23:38:59,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781173933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:38:59,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:38:59,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 23:38:59,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288830802] [2024-10-12 23:38:59,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:38:59,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 23:38:59,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:59,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 23:38:59,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:38:59,796 INFO L87 Difference]: Start difference. First operand 544 states and 808 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:38:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:59,957 INFO L93 Difference]: Finished difference Result 1237 states and 1827 transitions. [2024-10-12 23:38:59,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 23:38:59,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-12 23:38:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:59,959 INFO L225 Difference]: With dead ends: 1237 [2024-10-12 23:38:59,960 INFO L226 Difference]: Without dead ends: 760 [2024-10-12 23:38:59,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-12 23:38:59,963 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 1479 mSDsluCounter, 3195 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 3972 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:59,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 3972 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:38:59,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-10-12 23:38:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 552. [2024-10-12 23:38:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 1.484573502722323) internal successors, (818), 551 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:38:59,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 818 transitions. [2024-10-12 23:38:59,975 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 818 transitions. Word has length 73 [2024-10-12 23:38:59,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:59,975 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 818 transitions. [2024-10-12 23:38:59,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:38:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 818 transitions. [2024-10-12 23:38:59,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-12 23:38:59,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:59,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:38:59,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 23:38:59,976 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:59,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:59,976 INFO L85 PathProgramCache]: Analyzing trace with hash -646875833, now seen corresponding path program 1 times [2024-10-12 23:38:59,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:59,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747970028] [2024-10-12 23:38:59,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:59,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:39:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:39:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:39:00,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:39:00,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747970028] [2024-10-12 23:39:00,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747970028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:39:00,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:39:00,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:39:00,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599853842] [2024-10-12 23:39:00,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:39:00,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:39:00,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:39:00,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:39:00,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:39:00,245 INFO L87 Difference]: Start difference. First operand 552 states and 818 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:39:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:39:00,312 INFO L93 Difference]: Finished difference Result 1166 states and 1727 transitions. [2024-10-12 23:39:00,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:39:00,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-12 23:39:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:39:00,314 INFO L225 Difference]: With dead ends: 1166 [2024-10-12 23:39:00,315 INFO L226 Difference]: Without dead ends: 689 [2024-10-12 23:39:00,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:39:00,316 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1174 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:39:00,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 2345 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:39:00,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-10-12 23:39:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 553. [2024-10-12 23:39:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.4818840579710144) internal successors, (818), 552 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:39:00,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 818 transitions. [2024-10-12 23:39:00,325 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 818 transitions. Word has length 73 [2024-10-12 23:39:00,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:39:00,325 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 818 transitions. [2024-10-12 23:39:00,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:39:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 818 transitions. [2024-10-12 23:39:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 23:39:00,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:39:00,326 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:39:00,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 23:39:00,326 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:39:00,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:39:00,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1892345735, now seen corresponding path program 1 times [2024-10-12 23:39:00,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:39:00,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325332659] [2024-10-12 23:39:00,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:39:00,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:39:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:39:00,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:39:00,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:39:00,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325332659] [2024-10-12 23:39:00,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325332659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:39:00,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:39:00,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 23:39:00,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689900622] [2024-10-12 23:39:00,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:39:00,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 23:39:00,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:39:00,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 23:39:00,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:39:00,870 INFO L87 Difference]: Start difference. First operand 553 states and 818 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:39:01,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:39:01,080 INFO L93 Difference]: Finished difference Result 1211 states and 1792 transitions. [2024-10-12 23:39:01,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 23:39:01,081 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-12 23:39:01,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:39:01,083 INFO L225 Difference]: With dead ends: 1211 [2024-10-12 23:39:01,083 INFO L226 Difference]: Without dead ends: 734 [2024-10-12 23:39:01,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-10-12 23:39:01,086 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 1321 mSDsluCounter, 3661 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 4431 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:39:01,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 4431 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:39:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-10-12 23:39:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 598. [2024-10-12 23:39:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.4824120603015076) internal successors, (885), 597 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:39:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 885 transitions. [2024-10-12 23:39:01,096 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 885 transitions. Word has length 74 [2024-10-12 23:39:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:39:01,096 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 885 transitions. [2024-10-12 23:39:01,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:39:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 885 transitions. [2024-10-12 23:39:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 23:39:01,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:39:01,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:39:01,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 23:39:01,098 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:39:01,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:39:01,098 INFO L85 PathProgramCache]: Analyzing trace with hash -828225070, now seen corresponding path program 1 times [2024-10-12 23:39:01,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:39:01,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358012654] [2024-10-12 23:39:01,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:39:01,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:39:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:39:01,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:39:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:39:01,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 23:39:01,357 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:39:01,358 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:39:01,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 23:39:01,362 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:39:01,434 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:39:01,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:39:01 BoogieIcfgContainer [2024-10-12 23:39:01,437 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:39:01,438 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:39:01,438 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:39:01,438 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:39:01,438 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:38:55" (3/4) ... [2024-10-12 23:39:01,441 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 23:39:01,442 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:39:01,443 INFO L158 Benchmark]: Toolchain (without parser) took 8477.81ms. Allocated memory was 172.0MB in the beginning and 635.4MB in the end (delta: 463.5MB). Free memory was 114.6MB in the beginning and 547.4MB in the end (delta: -432.8MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2024-10-12 23:39:01,444 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 172.0MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:39:01,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.58ms. Allocated memory is still 172.0MB. Free memory was 114.3MB in the beginning and 74.8MB in the end (delta: 39.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-12 23:39:01,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 234.06ms. Allocated memory is still 172.0MB. Free memory was 74.8MB in the beginning and 94.1MB in the end (delta: -19.3MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-10-12 23:39:01,444 INFO L158 Benchmark]: Boogie Preprocessor took 261.03ms. Allocated memory is still 172.0MB. Free memory was 94.1MB in the beginning and 68.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 23:39:01,445 INFO L158 Benchmark]: RCFGBuilder took 1739.98ms. Allocated memory was 172.0MB in the beginning and 245.4MB in the end (delta: 73.4MB). Free memory was 68.9MB in the beginning and 111.7MB in the end (delta: -42.8MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2024-10-12 23:39:01,445 INFO L158 Benchmark]: TraceAbstraction took 5753.80ms. Allocated memory was 245.4MB in the beginning and 635.4MB in the end (delta: 390.1MB). Free memory was 110.6MB in the beginning and 548.5MB in the end (delta: -437.8MB). Peak memory consumption was 202.8MB. Max. memory is 16.1GB. [2024-10-12 23:39:01,445 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 635.4MB. Free memory was 548.5MB in the beginning and 547.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:39:01,446 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 172.0MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.58ms. Allocated memory is still 172.0MB. Free memory was 114.3MB in the beginning and 74.8MB in the end (delta: 39.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 234.06ms. Allocated memory is still 172.0MB. Free memory was 74.8MB in the beginning and 94.1MB in the end (delta: -19.3MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 261.03ms. Allocated memory is still 172.0MB. Free memory was 94.1MB in the beginning and 68.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1739.98ms. Allocated memory was 172.0MB in the beginning and 245.4MB in the end (delta: 73.4MB). Free memory was 68.9MB in the beginning and 111.7MB in the end (delta: -42.8MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5753.80ms. Allocated memory was 245.4MB in the beginning and 635.4MB in the end (delta: 390.1MB). Free memory was 110.6MB in the beginning and 548.5MB in the end (delta: -437.8MB). Peak memory consumption was 202.8MB. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 635.4MB. Free memory was 548.5MB in the beginning and 547.4MB in the end (delta: 1.0MB). 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 263. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 4); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (4 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_13 mask_SORT_13 = (SORT_13)-1 >> (sizeof(SORT_13) * 8 - 32); [L33] const SORT_13 msb_SORT_13 = (SORT_13)1 << (32 - 1); [L35] const SORT_36 mask_SORT_36 = (SORT_36)-1 >> (sizeof(SORT_36) * 8 - 3); [L36] const SORT_36 msb_SORT_36 = (SORT_36)1 << (3 - 1); [L38] const SORT_206 mask_SORT_206 = (SORT_206)-1 >> (sizeof(SORT_206) * 8 - 2); [L39] const SORT_206 msb_SORT_206 = (SORT_206)1 << (2 - 1); [L41] const SORT_1 var_10 = 0; [L42] const SORT_13 var_15 = 4; [L43] const SORT_5 var_22 = 1; [L44] const SORT_36 var_38 = 1; [L45] const SORT_36 var_43 = 2; [L46] const SORT_36 var_50 = 4; [L47] const SORT_36 var_53 = 3; [L48] const SORT_13 var_81 = 1; [L49] const SORT_13 var_101 = 0; [L50] const SORT_5 var_149 = 0; [L51] const SORT_1 var_186 = 15; [L53] SORT_1 input_2; [L54] SORT_1 input_3; [L55] SORT_1 input_4; [L56] SORT_5 input_6; [L57] SORT_1 input_7; [L58] SORT_5 input_8; [L59] SORT_5 input_9; [L60] SORT_13 input_94; [L61] SORT_1 input_96; [L62] SORT_1 input_107; [L63] SORT_1 input_112; [L64] SORT_1 input_114; [L65] SORT_1 input_129; [L66] SORT_5 input_140; [L67] SORT_5 input_144; [L68] SORT_5 input_147; [L69] SORT_5 input_152; [L70] SORT_5 input_155; [L71] SORT_5 input_158; [L72] SORT_1 input_173; [L73] SORT_1 input_176; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L75] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L76] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L77] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L78] SORT_5 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L79] SORT_5 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L80] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L81] SORT_1 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L82] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L83] SORT_1 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L84] SORT_1 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L85] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L86] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L87] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L88] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L89] SORT_1 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] SORT_1 init_12_arg_1 = var_10; [L92] state_11 = init_12_arg_1 [L93] SORT_1 init_18_arg_1 = var_10; [L94] state_17 = init_18_arg_1 [L95] SORT_1 init_20_arg_1 = var_10; [L96] state_19 = init_20_arg_1 [L97] SORT_5 init_24_arg_1 = var_22; [L98] state_23 = init_24_arg_1 [L99] SORT_5 init_29_arg_1 = var_22; [L100] state_28 = init_29_arg_1 [L101] SORT_1 init_33_arg_1 = var_10; [L102] state_32 = init_33_arg_1 [L103] SORT_1 init_35_arg_1 = var_10; [L104] state_34 = init_35_arg_1 [L105] SORT_1 init_42_arg_1 = var_10; [L106] state_41 = init_42_arg_1 [L107] SORT_1 init_47_arg_1 = var_10; [L108] state_46 = init_47_arg_1 [L109] SORT_1 init_49_arg_1 = var_10; [L110] state_48 = init_49_arg_1 [L111] SORT_1 init_58_arg_1 = var_10; [L112] state_57 = init_58_arg_1 [L113] SORT_1 init_60_arg_1 = var_10; [L114] state_59 = init_60_arg_1 [L115] SORT_1 init_64_arg_1 = var_10; [L116] state_63 = init_64_arg_1 [L117] SORT_1 init_66_arg_1 = var_10; [L118] state_65 = init_66_arg_1 [L119] SORT_1 init_71_arg_1 = var_10; [L120] state_70 = init_71_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L123] input_2 = __VERIFIER_nondet_uchar() [L124] input_3 = __VERIFIER_nondet_uchar() [L125] input_4 = __VERIFIER_nondet_uchar() [L126] input_6 = __VERIFIER_nondet_uchar() [L127] input_7 = __VERIFIER_nondet_uchar() [L128] input_8 = __VERIFIER_nondet_uchar() [L129] input_9 = __VERIFIER_nondet_uchar() [L130] input_94 = __VERIFIER_nondet_uint() [L131] input_96 = __VERIFIER_nondet_uchar() [L132] input_107 = __VERIFIER_nondet_uchar() [L133] input_112 = __VERIFIER_nondet_uchar() [L134] input_114 = __VERIFIER_nondet_uchar() [L135] input_129 = __VERIFIER_nondet_uchar() [L136] input_140 = __VERIFIER_nondet_uchar() [L137] input_144 = __VERIFIER_nondet_uchar() [L138] input_147 = __VERIFIER_nondet_uchar() [L139] input_152 = __VERIFIER_nondet_uchar() [L140] input_155 = __VERIFIER_nondet_uchar() [L141] input_158 = __VERIFIER_nondet_uchar() [L142] input_173 = __VERIFIER_nondet_uchar() [L143] input_176 = __VERIFIER_nondet_uchar() [L146] SORT_1 var_14_arg_0 = state_11; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_14_arg_0=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L147] EXPR var_14_arg_0 & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L147] var_14_arg_0 = var_14_arg_0 & mask_SORT_1 [L148] SORT_13 var_14 = var_14_arg_0; [L149] SORT_13 var_16_arg_0 = var_14; [L150] SORT_13 var_16_arg_1 = var_15; [L151] SORT_5 var_16 = var_16_arg_0 == var_16_arg_1; [L152] SORT_1 var_21_arg_0 = state_17; [L153] SORT_1 var_21_arg_1 = state_19; [L154] SORT_5 var_21 = var_21_arg_0 == var_21_arg_1; [L155] SORT_5 var_25_arg_0 = state_23; [L156] SORT_5 var_25 = ~var_25_arg_0; [L157] SORT_5 var_26_arg_0 = var_21; [L158] SORT_5 var_26_arg_1 = var_25; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26_arg_0=1, var_26_arg_1=-2, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L159] EXPR var_26_arg_0 & var_26_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L159] SORT_5 var_26 = var_26_arg_0 & var_26_arg_1; [L160] EXPR var_26 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L160] var_26 = var_26 & mask_SORT_5 [L161] SORT_5 var_27_arg_0 = var_16; [L162] SORT_5 var_27_arg_1 = var_26; [L163] SORT_5 var_27 = var_27_arg_0 == var_27_arg_1; [L164] SORT_5 var_30_arg_0 = state_28; [L165] SORT_5 var_30_arg_1 = state_23; [L166] SORT_5 var_30 = var_30_arg_0 == var_30_arg_1; [L167] SORT_5 var_31_arg_0 = var_27; [L168] SORT_5 var_31_arg_1 = var_30; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31_arg_0=0, var_31_arg_1=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L169] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L169] SORT_5 var_31 = var_31_arg_0 & var_31_arg_1; [L170] SORT_1 var_37_arg_0 = state_11; [L171] SORT_36 var_37 = var_37_arg_0 >> 0; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_37=0, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L172] EXPR var_37 & mask_SORT_36 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L172] var_37 = var_37 & mask_SORT_36 [L173] SORT_36 var_54_arg_0 = var_37; [L174] SORT_36 var_54_arg_1 = var_53; [L175] SORT_5 var_54 = var_54_arg_0 == var_54_arg_1; [L176] SORT_36 var_51_arg_0 = var_37; [L177] SORT_36 var_51_arg_1 = var_50; [L178] SORT_5 var_51 = var_51_arg_0 == var_51_arg_1; [L179] SORT_5 var_55_arg_0 = var_54; [L180] SORT_5 var_55_arg_1 = var_51; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_37=0, var_38=1, var_43=2, var_50=4, var_51=0, var_53=3, var_55_arg_0=0, var_55_arg_1=0, var_81=1] [L181] EXPR var_55_arg_0 | var_55_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_37=0, var_38=1, var_43=2, var_50=4, var_51=0, var_53=3, var_81=1] [L181] SORT_5 var_55 = var_55_arg_0 | var_55_arg_1; [L182] EXPR var_55 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_37=0, var_38=1, var_43=2, var_50=4, var_51=0, var_53=3, var_81=1] [L182] var_55 = var_55 & mask_SORT_5 [L183] SORT_5 var_52_arg_0 = var_51; [L184] SORT_1 var_52_arg_1 = state_48; [L185] SORT_1 var_52_arg_2 = state_46; [L186] SORT_1 var_52 = var_52_arg_0 ? var_52_arg_1 : var_52_arg_2; [L187] SORT_36 var_44_arg_0 = var_37; [L188] SORT_36 var_44_arg_1 = var_43; [L189] SORT_5 var_44 = var_44_arg_0 == var_44_arg_1; [L190] SORT_36 var_39_arg_0 = var_37; [L191] SORT_36 var_39_arg_1 = var_38; [L192] SORT_5 var_39 = var_39_arg_0 == var_39_arg_1; [L193] SORT_5 var_40_arg_0 = var_39; [L194] SORT_1 var_40_arg_1 = state_34; [L195] SORT_1 var_40_arg_2 = state_32; [L196] SORT_1 var_40 = var_40_arg_0 ? var_40_arg_1 : var_40_arg_2; [L197] SORT_5 var_45_arg_0 = var_44; [L198] SORT_1 var_45_arg_1 = state_41; [L199] SORT_1 var_45_arg_2 = var_40; [L200] SORT_1 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L201] SORT_5 var_56_arg_0 = var_55; [L202] SORT_1 var_56_arg_1 = var_52; [L203] SORT_1 var_56_arg_2 = var_45; [L204] SORT_1 var_56 = var_56_arg_0 ? var_56_arg_1 : var_56_arg_2; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_81=1] [L205] EXPR var_56 & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L205] var_56 = var_56 & mask_SORT_1 [L206] SORT_1 var_75_arg_0 = state_17; [L207] SORT_5 var_75 = var_75_arg_0 >> 2; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_75=0, var_81=1] [L208] EXPR var_75 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_81=1] [L208] var_75 = var_75 & mask_SORT_5 [L209] SORT_1 var_68_arg_0 = state_17; [L210] SORT_5 var_68 = var_68_arg_0 >> 1; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_68=0, var_75=0, var_81=1] [L211] EXPR var_68 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_75=0, var_81=1] [L211] var_68 = var_68 & mask_SORT_5 [L212] SORT_1 var_61_arg_0 = state_17; [L213] SORT_5 var_61 = var_61_arg_0 >> 0; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_61=0, var_68=0, var_75=0, var_81=1] [L214] EXPR var_61 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_68=0, var_75=0, var_81=1] [L214] var_61 = var_61 & mask_SORT_5 [L215] SORT_5 var_73_arg_0 = var_61; [L216] SORT_1 var_73_arg_1 = input_4; [L217] SORT_1 var_73_arg_2 = input_3; [L218] SORT_1 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L219] SORT_5 var_72_arg_0 = var_61; [L220] SORT_1 var_72_arg_1 = input_2; [L221] SORT_1 var_72_arg_2 = state_70; [L222] SORT_1 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L223] SORT_5 var_74_arg_0 = var_68; [L224] SORT_1 var_74_arg_1 = var_73; [L225] SORT_1 var_74_arg_2 = var_72; [L226] SORT_1 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2; [L227] SORT_5 var_67_arg_0 = var_61; [L228] SORT_1 var_67_arg_1 = state_65; [L229] SORT_1 var_67_arg_2 = state_63; [L230] SORT_1 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L231] SORT_5 var_62_arg_0 = var_61; [L232] SORT_1 var_62_arg_1 = state_59; [L233] SORT_1 var_62_arg_2 = state_57; [L234] SORT_1 var_62 = var_62_arg_0 ? var_62_arg_1 : var_62_arg_2; [L235] SORT_5 var_69_arg_0 = var_68; [L236] SORT_1 var_69_arg_1 = var_67; [L237] SORT_1 var_69_arg_2 = var_62; [L238] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L239] SORT_5 var_76_arg_0 = var_75; [L240] SORT_1 var_76_arg_1 = var_74; [L241] SORT_1 var_76_arg_2 = var_69; [L242] SORT_1 var_76 = var_76_arg_0 ? var_76_arg_1 : var_76_arg_2; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_76=0, var_81=1] [L243] EXPR var_76 & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_81=1] [L243] var_76 = var_76 & mask_SORT_1 [L244] SORT_1 var_77_arg_0 = var_56; [L245] SORT_1 var_77_arg_1 = var_76; [L246] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L247] SORT_5 var_78_arg_0 = state_28; [L248] SORT_5 var_78_arg_1 = var_77; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_78_arg_0=1, var_78_arg_1=1, var_81=1] [L249] EXPR var_78_arg_0 | var_78_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L249] SORT_5 var_78 = var_78_arg_0 | var_78_arg_1; [L250] SORT_5 var_79_arg_0 = var_31; [L251] SORT_5 var_79_arg_1 = var_78; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_79_arg_0=0, var_79_arg_1=1, var_81=1] [L252] EXPR var_79_arg_0 & var_79_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L252] SORT_5 var_79 = var_79_arg_0 & var_79_arg_1; [L253] SORT_5 var_80_arg_0 = var_79; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_80_arg_0=0, var_81=1] [L254] EXPR var_80_arg_0 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L254] var_80_arg_0 = var_80_arg_0 & mask_SORT_5 [L255] SORT_13 var_80 = var_80_arg_0; [L256] SORT_13 var_82_arg_0 = var_80; [L257] SORT_13 var_82_arg_1 = var_81; [L258] SORT_5 var_82 = var_82_arg_0 == var_82_arg_1; [L259] SORT_5 var_85_arg_0 = var_82; [L260] SORT_5 var_85 = ~var_85_arg_0; [L261] SORT_5 var_86_arg_0 = var_22; [L262] SORT_5 var_86_arg_1 = var_85; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1, var_86_arg_0=1, var_86_arg_1=-1] [L263] EXPR var_86_arg_0 & var_86_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L263] SORT_5 var_86 = var_86_arg_0 & var_86_arg_1; [L264] EXPR var_86 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L264] var_86 = var_86 & mask_SORT_5 [L265] SORT_5 bad_87_arg_0 = var_86; [L266] CALL __VERIFIER_assert(!(bad_87_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 535 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6361 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6361 mSDsluCounter, 20589 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15153 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 879 IncrementalHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 5436 mSDtfsCounter, 879 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=598occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 607 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 494 ConstructedInterpolants, 0 QuantifiedInterpolants, 1669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-12 23:39:01,476 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_FIFO.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 d34a336c538fc3840e4ea3ff0e6a49a015ced8c6fe61188192176428c4598a52 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:39:03,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:39:03,256 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-12 23:39:03,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:39:03,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:39:03,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:39:03,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:39:03,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:39:03,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:39:03,285 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:39:03,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:39:03,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:39:03,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:39:03,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:39:03,288 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:39:03,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:39:03,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:39:03,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:39:03,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:39:03,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:39:03,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:39:03,289 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 23:39:03,289 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 23:39:03,289 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:39:03,289 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 23:39:03,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:39:03,290 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:39:03,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:39:03,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:39:03,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:39:03,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:39:03,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:39:03,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:39:03,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:39:03,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:39:03,291 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 23:39:03,291 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 23:39:03,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:39:03,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:39:03,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:39:03,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:39:03,294 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 23:39:03,294 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 -> d34a336c538fc3840e4ea3ff0e6a49a015ced8c6fe61188192176428c4598a52 [2024-10-12 23:39:03,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:39:03,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:39:03,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:39:03,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:39:03,551 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:39:03,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_FIFO.c [2024-10-12 23:39:04,866 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:39:05,076 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:39:05,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_FIFO.c [2024-10-12 23:39:05,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d9e08ae6/c6803b0ebf154a55a153470a20f42e79/FLAG544b30724 [2024-10-12 23:39:05,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d9e08ae6/c6803b0ebf154a55a153470a20f42e79 [2024-10-12 23:39:05,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:39:05,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:39:05,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:39:05,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:39:05,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:39:05,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:39:05" (1/1) ... [2024-10-12 23:39:05,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664d74f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:05, skipping insertion in model container [2024-10-12 23:39:05,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:39:05" (1/1) ... [2024-10-12 23:39:05,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:39:05,636 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_FIFO.c[1246,1259] [2024-10-12 23:39:05,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:39:05,782 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:39:05,791 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_FIFO.c[1246,1259] [2024-10-12 23:39:05,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:39:05,881 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:39:05,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:05 WrapperNode [2024-10-12 23:39:05,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:39:05,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:39:05,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:39:05,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:39:05,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:05" (1/1) ... [2024-10-12 23:39:05,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:05" (1/1) ... [2024-10-12 23:39:05,976 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 878 [2024-10-12 23:39:05,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:39:05,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:39:05,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:39:05,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:39:05,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:05" (1/1) ... [2024-10-12 23:39:05,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:05" (1/1) ... [2024-10-12 23:39:05,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:05" (1/1) ... [2024-10-12 23:39:06,013 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 23:39:06,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:05" (1/1) ... [2024-10-12 23:39:06,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:05" (1/1) ... [2024-10-12 23:39:06,027 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:05" (1/1) ... [2024-10-12 23:39:06,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:05" (1/1) ... [2024-10-12 23:39:06,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:05" (1/1) ... [2024-10-12 23:39:06,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:05" (1/1) ... [2024-10-12 23:39:06,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:39:06,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:39:06,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:39:06,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:39:06,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:05" (1/1) ... [2024-10-12 23:39:06,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:39:06,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:39:06,090 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-10-12 23:39:06,099 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-10-12 23:39:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:39:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 23:39:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:39:06,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:39:06,325 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:39:06,327 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:39:06,997 INFO L? ?]: Removed 152 outVars from TransFormulas that were not future-live. [2024-10-12 23:39:06,997 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:39:07,029 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:39:07,029 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:39:07,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:39:07 BoogieIcfgContainer [2024-10-12 23:39:07,030 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:39:07,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:39:07,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:39:07,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:39:07,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:39:05" (1/3) ... [2024-10-12 23:39:07,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bfe480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:39:07, skipping insertion in model container [2024-10-12 23:39:07,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:05" (2/3) ... [2024-10-12 23:39:07,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bfe480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:39:07, skipping insertion in model container [2024-10-12 23:39:07,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:39:07" (3/3) ... [2024-10-12 23:39:07,036 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.v_FIFO.c [2024-10-12 23:39:07,048 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:39:07,048 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:39:07,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:39:07,097 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;@3a401a47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:39:07,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:39:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:39:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-12 23:39:07,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:39:07,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-12 23:39:07,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:39:07,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:39:07,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-12 23:39:07,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:39:07,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828371467] [2024-10-12 23:39:07,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:39:07,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:39:07,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:39:07,124 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-10-12 23:39:07,124 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-10-12 23:39:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:39:07,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-12 23:39:07,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:39:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:39:07,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:39:07,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:39:07,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828371467] [2024-10-12 23:39:07,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828371467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:39:07,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:39:07,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:39:07,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770122792] [2024-10-12 23:39:07,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:39:07,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:39:07,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:39:07,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:39:07,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:39:07,688 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:39:07,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:39:07,749 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-12 23:39:07,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:39:07,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-12 23:39:07,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:39:07,756 INFO L225 Difference]: With dead ends: 15 [2024-10-12 23:39:07,756 INFO L226 Difference]: Without dead ends: 9 [2024-10-12 23:39:07,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:39:07,760 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:39:07,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:39:07,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-12 23:39:07,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-12 23:39:07,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:39:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-12 23:39:07,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-12 23:39:07,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:39:07,782 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-12 23:39:07,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:39:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-12 23:39:07,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 23:39:07,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:39:07,784 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-12 23:39:07,788 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-10-12 23:39:07,984 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-10-12 23:39:07,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:39:07,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:39:07,986 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-12 23:39:07,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:39:07,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308241128] [2024-10-12 23:39:07,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:39:07,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:39:07,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:39:07,989 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-10-12 23:39:08,004 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-10-12 23:39:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:39:08,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-10-12 23:39:08,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:39:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:39:14,013 INFO L311 TraceCheckSpWp]: Computing backward predicates...