./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.bakery.2.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fa88b8fffb6d00fe351813dff04ff095de9add832c65b297aee5013953d8af16 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:23:58,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:23:58,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 05:23:58,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:23:58,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:23:58,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:23:58,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:23:58,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:23:58,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:23:58,981 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:23:58,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:23:58,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:23:58,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:23:58,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:23:58,985 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:23:58,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:23:58,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:23:58,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:23:58,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:23:58,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:23:58,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:23:58,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:23:58,988 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:23:58,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:23:58,992 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:23:58,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:23:58,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:23:58,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:23:58,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:23:58,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:23:58,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:23:58,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:23:58,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:23:58,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:23:58,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:23:58,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:23:58,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:23:58,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:23:58,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:23:58,995 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa88b8fffb6d00fe351813dff04ff095de9add832c65b297aee5013953d8af16 [2024-10-11 05:23:59,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:23:59,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:23:59,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:23:59,292 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:23:59,293 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:23:59,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c [2024-10-11 05:24:00,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:24:01,045 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:24:01,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c [2024-10-11 05:24:01,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c6f1e0b36/32a704a694a945538f1b55014be93317/FLAG8e2de1a16 [2024-10-11 05:24:01,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c6f1e0b36/32a704a694a945538f1b55014be93317 [2024-10-11 05:24:01,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:24:01,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:24:01,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:24:01,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:24:01,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:24:01,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:24:01" (1/1) ... [2024-10-11 05:24:01,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@422b28e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:01, skipping insertion in model container [2024-10-11 05:24:01,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:24:01" (1/1) ... [2024-10-11 05:24:01,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:24:01,397 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.bakery.2.prop1-func-interl.c[1173,1186] [2024-10-11 05:24:01,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:24:01,756 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:24:01,768 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.bakery.2.prop1-func-interl.c[1173,1186] [2024-10-11 05:24:01,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:24:01,935 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:24:01,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:01 WrapperNode [2024-10-11 05:24:01,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:24:01,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:24:01,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:24:01,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:24:01,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:01" (1/1) ... [2024-10-11 05:24:01,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:01" (1/1) ... [2024-10-11 05:24:02,417 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3502 [2024-10-11 05:24:02,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:24:02,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:24:02,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:24:02,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:24:02,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:01" (1/1) ... [2024-10-11 05:24:02,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:01" (1/1) ... [2024-10-11 05:24:02,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:01" (1/1) ... [2024-10-11 05:24:02,794 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 05:24:02,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:01" (1/1) ... [2024-10-11 05:24:02,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:01" (1/1) ... [2024-10-11 05:24:02,922 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:01" (1/1) ... [2024-10-11 05:24:02,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:01" (1/1) ... [2024-10-11 05:24:02,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:01" (1/1) ... [2024-10-11 05:24:03,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:01" (1/1) ... [2024-10-11 05:24:03,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:24:03,102 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:24:03,102 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:24:03,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:24:03,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:01" (1/1) ... [2024-10-11 05:24:03,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:24:03,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:24:03,149 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:24:03,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:24:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:24:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:24:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:24:03,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:24:03,582 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:24:03,584 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:24:07,323 INFO L? ?]: Removed 1945 outVars from TransFormulas that were not future-live. [2024-10-11 05:24:07,324 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:24:07,424 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:24:07,426 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 05:24:07,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:24:07 BoogieIcfgContainer [2024-10-11 05:24:07,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:24:07,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:24:07,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:24:07,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:24:07,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:24:01" (1/3) ... [2024-10-11 05:24:07,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d62e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:24:07, skipping insertion in model container [2024-10-11 05:24:07,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:01" (2/3) ... [2024-10-11 05:24:07,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d62e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:24:07, skipping insertion in model container [2024-10-11 05:24:07,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:24:07" (3/3) ... [2024-10-11 05:24:07,438 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.2.prop1-func-interl.c [2024-10-11 05:24:07,455 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:24:07,456 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 05:24:07,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:24:07,572 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;@6a3744c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:24:07,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 05:24:07,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 1211 states, 1209 states have (on average 1.500413564929694) internal successors, (1814), 1210 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:07,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 05:24:07,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:07,590 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, 1, 1] [2024-10-11 05:24:07,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:07,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:07,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1580999051, now seen corresponding path program 1 times [2024-10-11 05:24:07,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:24:07,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060165552] [2024-10-11 05:24:07,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:07,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:24:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:24:08,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:24:08,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:24:08,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060165552] [2024-10-11 05:24:08,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060165552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:24:08,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:24:08,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:24:08,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345552979] [2024-10-11 05:24:08,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:24:08,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:24:08,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:24:08,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:24:08,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:24:08,448 INFO L87 Difference]: Start difference. First operand has 1211 states, 1209 states have (on average 1.500413564929694) internal successors, (1814), 1210 states have internal predecessors, (1814), 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 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:08,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:24:08,602 INFO L93 Difference]: Finished difference Result 2346 states and 3516 transitions. [2024-10-11 05:24:08,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:24:08,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 76 [2024-10-11 05:24:08,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:24:08,626 INFO L225 Difference]: With dead ends: 2346 [2024-10-11 05:24:08,627 INFO L226 Difference]: Without dead ends: 1212 [2024-10-11 05:24:08,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:24:08,636 INFO L432 NwaCegarLoop]: 1809 mSDtfsCounter, 0 mSDsluCounter, 3613 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5422 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:24:08,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5422 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:24:08,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2024-10-11 05:24:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2024-10-11 05:24:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1211 states have (on average 1.4979355904211396) internal successors, (1814), 1211 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1814 transitions. [2024-10-11 05:24:08,753 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1814 transitions. Word has length 76 [2024-10-11 05:24:08,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:24:08,754 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1814 transitions. [2024-10-11 05:24:08,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1814 transitions. [2024-10-11 05:24:08,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 05:24:08,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:08,758 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, 1, 1, 1] [2024-10-11 05:24:08,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:24:08,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:08,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:08,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1768025946, now seen corresponding path program 1 times [2024-10-11 05:24:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:24:08,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506117022] [2024-10-11 05:24:08,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:08,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:24:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:24:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:24:09,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:24:09,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506117022] [2024-10-11 05:24:09,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506117022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:24:09,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:24:09,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:24:09,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460955941] [2024-10-11 05:24:09,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:24:09,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:24:09,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:24:09,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:24:09,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:24:09,073 INFO L87 Difference]: Start difference. First operand 1212 states and 1814 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:24:09,143 INFO L93 Difference]: Finished difference Result 2349 states and 3516 transitions. [2024-10-11 05:24:09,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:24:09,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 77 [2024-10-11 05:24:09,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:24:09,150 INFO L225 Difference]: With dead ends: 2349 [2024-10-11 05:24:09,150 INFO L226 Difference]: Without dead ends: 1214 [2024-10-11 05:24:09,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:24:09,156 INFO L432 NwaCegarLoop]: 1809 mSDtfsCounter, 0 mSDsluCounter, 3610 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5419 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:24:09,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5419 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:24:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2024-10-11 05:24:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2024-10-11 05:24:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1213 states have (on average 1.4971145919208573) internal successors, (1816), 1213 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1816 transitions. [2024-10-11 05:24:09,198 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1816 transitions. Word has length 77 [2024-10-11 05:24:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:24:09,199 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1816 transitions. [2024-10-11 05:24:09,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1816 transitions. [2024-10-11 05:24:09,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 05:24:09,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:09,203 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, 1, 1, 1, 1] [2024-10-11 05:24:09,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:24:09,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:09,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:09,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2123735996, now seen corresponding path program 1 times [2024-10-11 05:24:09,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:24:09,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848599313] [2024-10-11 05:24:09,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:09,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:24:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:24:09,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:24:09,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:24:09,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848599313] [2024-10-11 05:24:09,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848599313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:24:09,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:24:09,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:24:09,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437654826] [2024-10-11 05:24:09,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:24:09,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:24:09,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:24:09,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:24:09,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:24:09,533 INFO L87 Difference]: Start difference. First operand 1214 states and 1816 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:09,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:24:09,613 INFO L93 Difference]: Finished difference Result 2353 states and 3520 transitions. [2024-10-11 05:24:09,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:24:09,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 78 [2024-10-11 05:24:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:24:09,621 INFO L225 Difference]: With dead ends: 2353 [2024-10-11 05:24:09,621 INFO L226 Difference]: Without dead ends: 1216 [2024-10-11 05:24:09,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:24:09,626 INFO L432 NwaCegarLoop]: 1809 mSDtfsCounter, 0 mSDsluCounter, 3604 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5413 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:24:09,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5413 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:24:09,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-10-11 05:24:09,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1216. [2024-10-11 05:24:09,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1215 states have (on average 1.4962962962962962) internal successors, (1818), 1215 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:09,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1818 transitions. [2024-10-11 05:24:09,664 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1818 transitions. Word has length 78 [2024-10-11 05:24:09,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:24:09,664 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1818 transitions. [2024-10-11 05:24:09,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1818 transitions. [2024-10-11 05:24:09,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 05:24:09,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:09,666 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, 1, 1, 1, 1, 1] [2024-10-11 05:24:09,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:24:09,667 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:09,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:09,669 INFO L85 PathProgramCache]: Analyzing trace with hash -502419167, now seen corresponding path program 1 times [2024-10-11 05:24:09,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:24:09,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361641806] [2024-10-11 05:24:09,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:09,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:24:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:24:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:24:09,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:24:09,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361641806] [2024-10-11 05:24:09,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361641806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:24:09,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:24:09,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:24:09,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342113439] [2024-10-11 05:24:09,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:24:09,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:24:09,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:24:09,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:24:09,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:24:09,957 INFO L87 Difference]: Start difference. First operand 1216 states and 1818 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:10,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:24:10,027 INFO L93 Difference]: Finished difference Result 2363 states and 3532 transitions. [2024-10-11 05:24:10,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:24:10,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2024-10-11 05:24:10,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:24:10,036 INFO L225 Difference]: With dead ends: 2363 [2024-10-11 05:24:10,037 INFO L226 Difference]: Without dead ends: 1224 [2024-10-11 05:24:10,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:24:10,042 INFO L432 NwaCegarLoop]: 1809 mSDtfsCounter, 3 mSDsluCounter, 3604 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5413 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:24:10,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 5413 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:24:10,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2024-10-11 05:24:10,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1220. [2024-10-11 05:24:10,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 1219 states have (on average 1.4963084495488106) internal successors, (1824), 1219 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1824 transitions. [2024-10-11 05:24:10,073 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1824 transitions. Word has length 79 [2024-10-11 05:24:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:24:10,075 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1824 transitions. [2024-10-11 05:24:10,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:10,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1824 transitions. [2024-10-11 05:24:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 05:24:10,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:10,077 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:24:10,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:24:10,078 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:10,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:10,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1575898627, now seen corresponding path program 1 times [2024-10-11 05:24:10,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:24:10,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014762841] [2024-10-11 05:24:10,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:10,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:24:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:24:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:24:10,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:24:10,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014762841] [2024-10-11 05:24:10,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014762841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:24:10,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:24:10,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:24:10,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849685145] [2024-10-11 05:24:10,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:24:10,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:24:10,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:24:10,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:24:10,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:24:10,576 INFO L87 Difference]: Start difference. First operand 1220 states and 1824 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:11,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:24:11,875 INFO L93 Difference]: Finished difference Result 2375 states and 3551 transitions. [2024-10-11 05:24:11,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:24:11,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2024-10-11 05:24:11,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:24:11,880 INFO L225 Difference]: With dead ends: 2375 [2024-10-11 05:24:11,881 INFO L226 Difference]: Without dead ends: 1232 [2024-10-11 05:24:11,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:24:11,884 INFO L432 NwaCegarLoop]: 1378 mSDtfsCounter, 1761 mSDsluCounter, 4123 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 5501 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:24:11,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 5501 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:24:11,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2024-10-11 05:24:11,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1230. [2024-10-11 05:24:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1229 states have (on average 1.4938974776240845) internal successors, (1836), 1229 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1836 transitions. [2024-10-11 05:24:11,911 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1836 transitions. Word has length 80 [2024-10-11 05:24:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:24:11,912 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1836 transitions. [2024-10-11 05:24:11,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1836 transitions. [2024-10-11 05:24:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 05:24:11,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:11,915 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:24:11,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:24:11,915 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:11,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:11,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1288870427, now seen corresponding path program 1 times [2024-10-11 05:24:11,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:24:11,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809249641] [2024-10-11 05:24:11,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:11,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:24:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:24:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:24:12,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:24:12,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809249641] [2024-10-11 05:24:12,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809249641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:24:12,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:24:12,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:24:12,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979437554] [2024-10-11 05:24:12,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:24:12,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:24:12,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:24:12,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:24:12,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:24:12,174 INFO L87 Difference]: Start difference. First operand 1230 states and 1836 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:24:13,588 INFO L93 Difference]: Finished difference Result 3517 states and 5251 transitions. [2024-10-11 05:24:13,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:24:13,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2024-10-11 05:24:13,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:24:13,599 INFO L225 Difference]: With dead ends: 3517 [2024-10-11 05:24:13,599 INFO L226 Difference]: Without dead ends: 2364 [2024-10-11 05:24:13,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:24:13,607 INFO L432 NwaCegarLoop]: 1395 mSDtfsCounter, 1727 mSDsluCounter, 4083 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 5478 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:24:13,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 5478 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:24:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2024-10-11 05:24:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 1288. [2024-10-11 05:24:13,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1287 states have (on average 1.491841491841492) internal successors, (1920), 1287 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1920 transitions. [2024-10-11 05:24:13,648 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1920 transitions. Word has length 81 [2024-10-11 05:24:13,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:24:13,648 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1920 transitions. [2024-10-11 05:24:13,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1920 transitions. [2024-10-11 05:24:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 05:24:13,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:13,654 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:24:13,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:24:13,655 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:13,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash 667810974, now seen corresponding path program 1 times [2024-10-11 05:24:13,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:24:13,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435577551] [2024-10-11 05:24:13,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:13,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:24:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 05:24:13,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 05:24:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 05:24:13,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 05:24:13,838 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 05:24:13,840 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 05:24:13,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:24:13,848 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:24:13,935 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 05:24:13,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:24:13 BoogieIcfgContainer [2024-10-11 05:24:13,940 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 05:24:13,941 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 05:24:13,941 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 05:24:13,941 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 05:24:13,942 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:24:07" (3/4) ... [2024-10-11 05:24:13,944 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 05:24:13,945 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 05:24:13,946 INFO L158 Benchmark]: Toolchain (without parser) took 12867.13ms. Allocated memory was 167.8MB in the beginning and 666.9MB in the end (delta: 499.1MB). Free memory was 108.0MB in the beginning and 181.0MB in the end (delta: -73.1MB). Peak memory consumption was 424.5MB. Max. memory is 16.1GB. [2024-10-11 05:24:13,946 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 05:24:13,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 856.59ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 98.5MB in the end (delta: 9.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 05:24:13,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 481.14ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 61.5MB in the end (delta: 37.0MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2024-10-11 05:24:13,947 INFO L158 Benchmark]: Boogie Preprocessor took 682.77ms. Allocated memory was 167.8MB in the beginning and 274.7MB in the end (delta: 107.0MB). Free memory was 61.5MB in the beginning and 146.3MB in the end (delta: -84.8MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2024-10-11 05:24:13,948 INFO L158 Benchmark]: RCFGBuilder took 4324.87ms. Allocated memory was 274.7MB in the beginning and 549.5MB in the end (delta: 274.7MB). Free memory was 146.3MB in the beginning and 414.9MB in the end (delta: -268.5MB). Peak memory consumption was 178.6MB. Max. memory is 16.1GB. [2024-10-11 05:24:13,949 INFO L158 Benchmark]: TraceAbstraction took 6511.49ms. Allocated memory was 549.5MB in the beginning and 666.9MB in the end (delta: 117.4MB). Free memory was 413.8MB in the beginning and 181.0MB in the end (delta: 232.8MB). Peak memory consumption was 350.2MB. Max. memory is 16.1GB. [2024-10-11 05:24:13,949 INFO L158 Benchmark]: Witness Printer took 4.36ms. Allocated memory is still 666.9MB. Free memory is still 181.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 05:24:13,951 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.21ms. Allocated memory is still 100.7MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 856.59ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 98.5MB in the end (delta: 9.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 481.14ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 61.5MB in the end (delta: 37.0MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 682.77ms. Allocated memory was 167.8MB in the beginning and 274.7MB in the end (delta: 107.0MB). Free memory was 61.5MB in the beginning and 146.3MB in the end (delta: -84.8MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. * RCFGBuilder took 4324.87ms. Allocated memory was 274.7MB in the beginning and 549.5MB in the end (delta: 274.7MB). Free memory was 146.3MB in the beginning and 414.9MB in the end (delta: -268.5MB). Peak memory consumption was 178.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6511.49ms. Allocated memory was 549.5MB in the beginning and 666.9MB in the end (delta: 117.4MB). Free memory was 413.8MB in the beginning and 181.0MB in the end (delta: 232.8MB). Peak memory consumption was 350.2MB. Max. memory is 16.1GB. * Witness Printer took 4.36ms. Allocated memory is still 666.9MB. Free memory is still 181.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 174. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_22 = 0; [L40] const SORT_4 var_45 = 1; [L41] const SORT_4 var_46 = 0; [L42] const SORT_2 var_54 = 0; [L43] const SORT_2 var_56 = 1; [L44] const SORT_3 var_66 = 0; [L45] const SORT_4 var_153 = 2; [L46] const SORT_2 var_165 = 2; [L47] const SORT_4 var_167 = 6; [L49] SORT_1 input_53; [L50] SORT_1 input_55; [L51] SORT_1 input_60; [L52] SORT_1 input_61; [L53] SORT_1 input_65; [L54] SORT_1 input_73; [L55] SORT_1 input_80; [L56] SORT_1 input_84; [L57] SORT_1 input_85; [L58] SORT_1 input_97; [L59] SORT_1 input_101; [L60] SORT_1 input_102; [L61] SORT_1 input_121; [L62] SORT_1 input_124; [L63] SORT_1 input_140; [L64] SORT_1 input_143; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L66] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L67] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L68] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L69] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L70] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L71] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L72] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L73] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L74] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L75] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L76] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L77] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L78] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L79] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L80] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L81] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L82] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L83] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L84] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] SORT_2 init_7_arg_1 = var_5; [L87] state_6 = init_7_arg_1 [L88] SORT_2 init_9_arg_1 = var_5; [L89] state_8 = init_9_arg_1 [L90] SORT_2 init_11_arg_1 = var_5; [L91] state_10 = init_11_arg_1 [L92] SORT_2 init_13_arg_1 = var_5; [L93] state_12 = init_13_arg_1 [L94] SORT_2 init_15_arg_1 = var_5; [L95] state_14 = init_15_arg_1 [L96] SORT_2 init_17_arg_1 = var_5; [L97] state_16 = init_17_arg_1 [L98] SORT_2 init_19_arg_1 = var_5; [L99] state_18 = init_19_arg_1 [L100] SORT_2 init_21_arg_1 = var_5; [L101] state_20 = init_21_arg_1 [L102] SORT_1 init_24_arg_1 = var_22; [L103] state_23 = init_24_arg_1 [L104] SORT_1 init_26_arg_1 = var_22; [L105] state_25 = init_26_arg_1 [L106] SORT_1 init_28_arg_1 = var_22; [L107] state_27 = init_28_arg_1 [L108] SORT_1 init_30_arg_1 = var_22; [L109] state_29 = init_30_arg_1 [L110] SORT_1 init_32_arg_1 = var_22; [L111] state_31 = init_32_arg_1 [L112] SORT_1 init_34_arg_1 = var_22; [L113] state_33 = init_34_arg_1 [L114] SORT_1 init_36_arg_1 = var_22; [L115] state_35 = init_36_arg_1 [L116] SORT_1 init_38_arg_1 = var_22; [L117] state_37 = init_38_arg_1 [L118] SORT_1 init_40_arg_1 = var_22; [L119] state_39 = init_40_arg_1 [L120] SORT_1 init_42_arg_1 = var_22; [L121] state_41 = init_42_arg_1 [L122] SORT_1 init_44_arg_1 = var_22; [L123] state_43 = init_44_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L126] input_53 = __VERIFIER_nondet_uchar() [L127] EXPR input_53 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L127] input_53 = input_53 & mask_SORT_1 [L128] input_55 = __VERIFIER_nondet_uchar() [L129] EXPR input_55 & mask_SORT_1 VAL [input_53=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L129] input_55 = input_55 & mask_SORT_1 [L130] input_60 = __VERIFIER_nondet_uchar() [L131] EXPR input_60 & mask_SORT_1 VAL [input_53=0, input_55=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L131] input_60 = input_60 & mask_SORT_1 [L132] input_61 = __VERIFIER_nondet_uchar() [L133] EXPR input_61 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L133] input_61 = input_61 & mask_SORT_1 [L134] input_65 = __VERIFIER_nondet_uchar() [L135] EXPR input_65 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L135] input_65 = input_65 & mask_SORT_1 [L136] input_73 = __VERIFIER_nondet_uchar() [L137] EXPR input_73 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L137] input_73 = input_73 & mask_SORT_1 [L138] input_80 = __VERIFIER_nondet_uchar() [L139] EXPR input_80 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L139] input_80 = input_80 & mask_SORT_1 [L140] input_84 = __VERIFIER_nondet_uchar() [L141] EXPR input_84 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L141] input_84 = input_84 & mask_SORT_1 [L142] input_85 = __VERIFIER_nondet_uchar() [L143] EXPR input_85 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L143] input_85 = input_85 & mask_SORT_1 [L144] input_97 = __VERIFIER_nondet_uchar() [L145] EXPR input_97 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L145] input_97 = input_97 & mask_SORT_1 [L146] input_101 = __VERIFIER_nondet_uchar() [L147] EXPR input_101 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L147] input_101 = input_101 & mask_SORT_1 [L148] input_102 = __VERIFIER_nondet_uchar() [L149] EXPR input_102 & mask_SORT_1 VAL [input_101=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L149] input_102 = input_102 & mask_SORT_1 [L150] input_121 = __VERIFIER_nondet_uchar() [L151] input_124 = __VERIFIER_nondet_uchar() [L152] input_140 = __VERIFIER_nondet_uchar() [L153] input_143 = __VERIFIER_nondet_uchar() [L156] SORT_1 var_47_arg_0 = state_31; [L157] SORT_4 var_47_arg_1 = var_45; [L158] SORT_4 var_47_arg_2 = var_46; [L159] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L160] SORT_1 var_48_arg_0 = state_41; [L161] SORT_4 var_48_arg_1 = var_45; [L162] SORT_4 var_48_arg_2 = var_46; [L163] SORT_4 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L164] SORT_4 var_49_arg_0 = var_47; [L165] SORT_4 var_49_arg_1 = var_48; [L166] SORT_4 var_49 = var_49_arg_0 + var_49_arg_1; VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_49=0, var_54=0, var_56=1, var_66=0] [L167] EXPR var_49 & mask_SORT_4 VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L167] var_49 = var_49 & mask_SORT_4 [L168] SORT_4 var_50_arg_0 = var_49; [L169] SORT_4 var_50_arg_1 = var_45; [L170] SORT_1 var_50 = var_50_arg_0 <= var_50_arg_1; [L171] SORT_1 var_51_arg_0 = ~state_43; VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_50=1, var_51_arg_0=-1, var_54=0, var_56=1, var_66=0] [L172] EXPR var_51_arg_0 & mask_SORT_1 VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_50=1, var_54=0, var_56=1, var_66=0] [L172] var_51_arg_0 = var_51_arg_0 & mask_SORT_1 [L173] SORT_1 var_51_arg_1 = ~var_50; VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_51_arg_0=1, var_51_arg_1=-2, var_54=0, var_56=1, var_66=0] [L174] EXPR var_51_arg_1 & mask_SORT_1 VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_51_arg_0=1, var_54=0, var_56=1, var_66=0] [L174] var_51_arg_1 = var_51_arg_1 & mask_SORT_1 [L175] EXPR var_51_arg_0 & var_51_arg_1 VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L175] SORT_1 var_51 = var_51_arg_0 & var_51_arg_1; [L176] EXPR var_51 & mask_SORT_1 VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L176] var_51 = var_51 & mask_SORT_1 [L177] SORT_1 bad_52_arg_0 = var_51; [L178] CALL __VERIFIER_assert(!(bad_52_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1211 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3491 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3491 mSDsluCounter, 32646 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22637 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3474 IncrementalHoareTripleChecker+Invalid, 3476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 10009 mSDtfsCounter, 3474 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1288occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 1082 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 553 NumberOfCodeBlocks, 553 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 1337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 05:24:13,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fa88b8fffb6d00fe351813dff04ff095de9add832c65b297aee5013953d8af16 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:24:16,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:24:16,480 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 05:24:16,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:24:16,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:24:16,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:24:16,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:24:16,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:24:16,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:24:16,518 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:24:16,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:24:16,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:24:16,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:24:16,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:24:16,522 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:24:16,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:24:16,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:24:16,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:24:16,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:24:16,523 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:24:16,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:24:16,527 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 05:24:16,527 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 05:24:16,528 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:24:16,528 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 05:24:16,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:24:16,528 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:24:16,529 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:24:16,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:24:16,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:24:16,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:24:16,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:24:16,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:24:16,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:24:16,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:24:16,530 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 05:24:16,530 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 05:24:16,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:24:16,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:24:16,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:24:16,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:24:16,537 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 05:24:16,537 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa88b8fffb6d00fe351813dff04ff095de9add832c65b297aee5013953d8af16 [2024-10-11 05:24:16,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:24:16,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:24:16,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:24:16,920 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:24:16,921 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:24:16,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c [2024-10-11 05:24:18,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:24:18,871 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:24:18,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c [2024-10-11 05:24:18,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/162ebe257/e4af57c4576b4343849d004771de8512/FLAG84a7c78f5 [2024-10-11 05:24:18,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/162ebe257/e4af57c4576b4343849d004771de8512 [2024-10-11 05:24:18,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:24:18,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:24:18,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:24:18,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:24:18,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:24:18,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:24:18" (1/1) ... [2024-10-11 05:24:18,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29244d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:18, skipping insertion in model container [2024-10-11 05:24:18,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:24:18" (1/1) ... [2024-10-11 05:24:19,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:24:19,222 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.bakery.2.prop1-func-interl.c[1173,1186] [2024-10-11 05:24:19,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:24:19,540 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:24:19,554 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.bakery.2.prop1-func-interl.c[1173,1186] [2024-10-11 05:24:19,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:24:19,686 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:24:19,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:19 WrapperNode [2024-10-11 05:24:19,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:24:19,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:24:19,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:24:19,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:24:19,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:19" (1/1) ... [2024-10-11 05:24:19,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:19" (1/1) ... [2024-10-11 05:24:19,817 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1094 [2024-10-11 05:24:19,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:24:19,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:24:19,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:24:19,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:24:19,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:19" (1/1) ... [2024-10-11 05:24:19,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:19" (1/1) ... [2024-10-11 05:24:19,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:19" (1/1) ... [2024-10-11 05:24:19,871 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 05:24:19,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:19" (1/1) ... [2024-10-11 05:24:19,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:19" (1/1) ... [2024-10-11 05:24:19,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:19" (1/1) ... [2024-10-11 05:24:19,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:19" (1/1) ... [2024-10-11 05:24:19,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:19" (1/1) ... [2024-10-11 05:24:19,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:19" (1/1) ... [2024-10-11 05:24:19,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:24:19,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:24:19,959 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:24:19,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:24:19,960 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:19" (1/1) ... [2024-10-11 05:24:19,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:24:20,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:24:20,022 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:24:20,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:24:20,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:24:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 05:24:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:24:20,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:24:20,311 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:24:20,313 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:24:21,353 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-10-11 05:24:21,354 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:24:21,421 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:24:21,422 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 05:24:21,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:24:21 BoogieIcfgContainer [2024-10-11 05:24:21,423 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:24:21,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:24:21,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:24:21,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:24:21,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:24:18" (1/3) ... [2024-10-11 05:24:21,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b5681a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:24:21, skipping insertion in model container [2024-10-11 05:24:21,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:19" (2/3) ... [2024-10-11 05:24:21,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b5681a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:24:21, skipping insertion in model container [2024-10-11 05:24:21,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:24:21" (3/3) ... [2024-10-11 05:24:21,433 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.2.prop1-func-interl.c [2024-10-11 05:24:21,449 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:24:21,450 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 05:24:21,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:24:21,521 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;@6713d043, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:24:21,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 05:24:21,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:21,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 05:24:21,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:21,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 05:24:21,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:21,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:21,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 05:24:21,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 05:24:21,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078050940] [2024-10-11 05:24:21,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:21,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 05:24:21,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 05:24:21,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 05:24:21,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 05:24:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:24:21,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 05:24:21,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:24:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:24:22,151 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:24:22,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 05:24:22,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078050940] [2024-10-11 05:24:22,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078050940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:24:22,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:24:22,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 05:24:22,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973868976] [2024-10-11 05:24:22,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:24:22,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:24:22,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 05:24:22,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:24:22,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:24:22,195 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:24:22,330 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 05:24:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:24:22,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 05:24:22,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:24:22,340 INFO L225 Difference]: With dead ends: 15 [2024-10-11 05:24:22,341 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 05:24:22,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:24:22,348 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:24:22,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:24:22,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 05:24:22,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 05:24:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 05:24:22,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 05:24:22,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:24:22,379 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 05:24:22,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:24:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 05:24:22,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 05:24:22,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:22,381 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 05:24:22,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 05:24:22,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 05:24:22,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:22,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 05:24:22,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 05:24:22,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370521648] [2024-10-11 05:24:22,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:22,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 05:24:22,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 05:24:22,586 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 05:24:22,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 05:24:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:24:22,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 05:24:22,999 INFO L278 TraceCheckSpWp]: Computing forward predicates...