./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 81099e1fe8016daaefd672ebf53a7cbfe30573425760bd713b63c430b338ca02 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:13:30,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:13:30,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 19:13:30,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:13:30,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:13:30,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:13:30,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:13:30,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:13:30,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:13:30,860 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:13:30,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:13:30,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:13:30,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:13:30,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:13:30,862 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:13:30,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:13:30,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:13:30,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:13:30,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:13:30,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:13:30,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:13:30,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:13:30,867 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:13:30,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:13:30,867 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:13:30,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:13:30,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:13:30,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:13:30,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:13:30,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:13:30,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:13:30,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:13:30,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:13:30,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:13:30,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:13:30,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:13:30,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:13:30,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:13:30,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:13:30,871 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 81099e1fe8016daaefd672ebf53a7cbfe30573425760bd713b63c430b338ca02 [2024-11-08 19:13:31,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:13:31,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:13:31,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:13:31,207 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:13:31,208 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:13:31,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2024-11-08 19:13:32,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:13:33,011 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:13:33,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2024-11-08 19:13:33,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed28803a7/1b7b674dfd774547bbef4eb6b4471800/FLAGf4a3f8857 [2024-11-08 19:13:33,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed28803a7/1b7b674dfd774547bbef4eb6b4471800 [2024-11-08 19:13:33,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:13:33,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:13:33,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:13:33,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:13:33,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:13:33,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:13:33" (1/1) ... [2024-11-08 19:13:33,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a60bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:33, skipping insertion in model container [2024-11-08 19:13:33,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:13:33" (1/1) ... [2024-11-08 19:13:33,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:13:33,307 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c[1266,1279] [2024-11-08 19:13:33,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:13:33,466 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:13:33,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c[1266,1279] [2024-11-08 19:13:33,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:13:33,577 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:13:33,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:33 WrapperNode [2024-11-08 19:13:33,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:13:33,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:13:33,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:13:33,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:13:33,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:33" (1/1) ... [2024-11-08 19:13:33,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:33" (1/1) ... [2024-11-08 19:13:33,689 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 732 [2024-11-08 19:13:33,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:13:33,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:13:33,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:13:33,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:13:33,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:33" (1/1) ... [2024-11-08 19:13:33,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:33" (1/1) ... [2024-11-08 19:13:33,730 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:33" (1/1) ... [2024-11-08 19:13:33,786 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:13:33,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:33" (1/1) ... [2024-11-08 19:13:33,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:33" (1/1) ... [2024-11-08 19:13:33,816 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:33" (1/1) ... [2024-11-08 19:13:33,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:33" (1/1) ... [2024-11-08 19:13:33,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:33" (1/1) ... [2024-11-08 19:13:33,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:33" (1/1) ... [2024-11-08 19:13:33,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:13:33,865 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:13:33,865 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:13:33,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:13:33,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:33" (1/1) ... [2024-11-08 19:13:33,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:13:33,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:13:33,910 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:13:33,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:13:34,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:13:34,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:13:34,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:13:34,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:13:34,202 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:13:34,204 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:13:35,106 INFO L? ?]: Removed 381 outVars from TransFormulas that were not future-live. [2024-11-08 19:13:35,107 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:13:35,133 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:13:35,133 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:13:35,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:13:35 BoogieIcfgContainer [2024-11-08 19:13:35,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:13:35,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:13:35,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:13:35,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:13:35,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:13:33" (1/3) ... [2024-11-08 19:13:35,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d96cfe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:13:35, skipping insertion in model container [2024-11-08 19:13:35,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:33" (2/3) ... [2024-11-08 19:13:35,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d96cfe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:13:35, skipping insertion in model container [2024-11-08 19:13:35,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:13:35" (3/3) ... [2024-11-08 19:13:35,148 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2024-11-08 19:13:35,169 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:13:35,170 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:13:35,235 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:13:35,241 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;@4d1e8448, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:13:35,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:13:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 141 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:35,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 19:13:35,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:35,254 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] [2024-11-08 19:13:35,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:35,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:35,260 INFO L85 PathProgramCache]: Analyzing trace with hash 387884158, now seen corresponding path program 1 times [2024-11-08 19:13:35,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:35,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963381146] [2024-11-08 19:13:35,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:35,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:36,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:36,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963381146] [2024-11-08 19:13:36,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963381146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:36,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:36,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:13:36,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902992339] [2024-11-08 19:13:36,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:36,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:13:36,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:36,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:13:36,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:36,105 INFO L87 Difference]: Start difference. First operand has 142 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 141 states have internal predecessors, (209), 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 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:36,176 INFO L93 Difference]: Finished difference Result 229 states and 339 transitions. [2024-11-08 19:13:36,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:13:36,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2024-11-08 19:13:36,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:36,193 INFO L225 Difference]: With dead ends: 229 [2024-11-08 19:13:36,193 INFO L226 Difference]: Without dead ends: 141 [2024-11-08 19:13:36,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:36,204 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:36,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 603 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:13:36,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-08 19:13:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-08 19:13:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 140 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2024-11-08 19:13:36,263 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 41 [2024-11-08 19:13:36,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:36,264 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2024-11-08 19:13:36,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2024-11-08 19:13:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 19:13:36,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:36,268 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] [2024-11-08 19:13:36,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:13:36,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:36,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:36,270 INFO L85 PathProgramCache]: Analyzing trace with hash -858797603, now seen corresponding path program 1 times [2024-11-08 19:13:36,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:36,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011843723] [2024-11-08 19:13:36,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:36,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:36,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:36,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011843723] [2024-11-08 19:13:36,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011843723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:36,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:36,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:13:36,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108893491] [2024-11-08 19:13:36,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:36,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:13:36,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:36,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:13:36,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:36,512 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:36,561 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2024-11-08 19:13:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:13:36,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2024-11-08 19:13:36,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:36,563 INFO L225 Difference]: With dead ends: 230 [2024-11-08 19:13:36,563 INFO L226 Difference]: Without dead ends: 143 [2024-11-08 19:13:36,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:36,565 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:36,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:13:36,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-08 19:13:36,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-08 19:13:36,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.471830985915493) internal successors, (209), 142 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2024-11-08 19:13:36,589 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 42 [2024-11-08 19:13:36,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:36,590 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2024-11-08 19:13:36,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:36,590 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2024-11-08 19:13:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 19:13:36,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:36,592 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] [2024-11-08 19:13:36,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:13:36,592 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:36,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:36,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1950887625, now seen corresponding path program 1 times [2024-11-08 19:13:36,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:36,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562101083] [2024-11-08 19:13:36,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:36,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:37,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:37,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562101083] [2024-11-08 19:13:37,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562101083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:37,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:37,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:13:37,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524697752] [2024-11-08 19:13:37,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:37,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:13:37,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:37,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:13:37,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:13:37,016 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:37,154 INFO L93 Difference]: Finished difference Result 236 states and 344 transitions. [2024-11-08 19:13:37,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:13:37,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2024-11-08 19:13:37,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:37,156 INFO L225 Difference]: With dead ends: 236 [2024-11-08 19:13:37,156 INFO L226 Difference]: Without dead ends: 147 [2024-11-08 19:13:37,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:13:37,158 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 178 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:37,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 736 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-08 19:13:37,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-08 19:13:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.4620689655172414) internal successors, (212), 145 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2024-11-08 19:13:37,179 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 43 [2024-11-08 19:13:37,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:37,179 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2024-11-08 19:13:37,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:37,179 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2024-11-08 19:13:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 19:13:37,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:37,181 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] [2024-11-08 19:13:37,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:13:37,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:37,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:37,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1216571104, now seen corresponding path program 1 times [2024-11-08 19:13:37,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:37,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218950380] [2024-11-08 19:13:37,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:37,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:38,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:38,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218950380] [2024-11-08 19:13:38,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218950380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:38,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:38,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:13:38,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872920901] [2024-11-08 19:13:38,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:38,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:13:38,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:38,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:13:38,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:13:38,045 INFO L87 Difference]: Start difference. First operand 146 states and 212 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:38,146 INFO L93 Difference]: Finished difference Result 246 states and 356 transitions. [2024-11-08 19:13:38,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:13:38,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 44 [2024-11-08 19:13:38,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:38,150 INFO L225 Difference]: With dead ends: 246 [2024-11-08 19:13:38,150 INFO L226 Difference]: Without dead ends: 154 [2024-11-08 19:13:38,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:13:38,151 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 190 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:38,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 984 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:13:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-08 19:13:38,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2024-11-08 19:13:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.4533333333333334) internal successors, (218), 150 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 218 transitions. [2024-11-08 19:13:38,171 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 218 transitions. Word has length 44 [2024-11-08 19:13:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:38,171 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 218 transitions. [2024-11-08 19:13:38,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 218 transitions. [2024-11-08 19:13:38,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 19:13:38,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:38,173 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] [2024-11-08 19:13:38,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:13:38,173 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:38,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:38,174 INFO L85 PathProgramCache]: Analyzing trace with hash 560912804, now seen corresponding path program 1 times [2024-11-08 19:13:38,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:38,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502385592] [2024-11-08 19:13:38,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:38,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:38,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:38,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502385592] [2024-11-08 19:13:38,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502385592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:38,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:38,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:13:38,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294694916] [2024-11-08 19:13:38,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:38,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:13:38,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:38,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:13:38,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:13:38,563 INFO L87 Difference]: Start difference. First operand 151 states and 218 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:38,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:38,695 INFO L93 Difference]: Finished difference Result 252 states and 362 transitions. [2024-11-08 19:13:38,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:13:38,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 44 [2024-11-08 19:13:38,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:38,697 INFO L225 Difference]: With dead ends: 252 [2024-11-08 19:13:38,698 INFO L226 Difference]: Without dead ends: 155 [2024-11-08 19:13:38,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:13:38,700 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 176 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:38,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 924 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-08 19:13:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2024-11-08 19:13:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.4533333333333334) internal successors, (218), 150 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 218 transitions. [2024-11-08 19:13:38,717 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 218 transitions. Word has length 44 [2024-11-08 19:13:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:38,718 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 218 transitions. [2024-11-08 19:13:38,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 218 transitions. [2024-11-08 19:13:38,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 19:13:38,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:38,720 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] [2024-11-08 19:13:38,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:13:38,721 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:38,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:38,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1978279468, now seen corresponding path program 1 times [2024-11-08 19:13:38,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:38,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111084892] [2024-11-08 19:13:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:38,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:38,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:38,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:38,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111084892] [2024-11-08 19:13:38,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111084892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:38,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:38,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:13:38,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539788267] [2024-11-08 19:13:38,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:38,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:13:38,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:38,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:13:38,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:13:38,975 INFO L87 Difference]: Start difference. First operand 151 states and 218 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:39,229 INFO L93 Difference]: Finished difference Result 283 states and 401 transitions. [2024-11-08 19:13:39,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:39,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-08 19:13:39,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:39,231 INFO L225 Difference]: With dead ends: 283 [2024-11-08 19:13:39,231 INFO L226 Difference]: Without dead ends: 186 [2024-11-08 19:13:39,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:13:39,232 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 237 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:39,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 644 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:13:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-08 19:13:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 159. [2024-11-08 19:13:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.4430379746835442) internal successors, (228), 158 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 228 transitions. [2024-11-08 19:13:39,245 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 228 transitions. Word has length 45 [2024-11-08 19:13:39,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:39,245 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 228 transitions. [2024-11-08 19:13:39,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 228 transitions. [2024-11-08 19:13:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 19:13:39,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:39,249 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] [2024-11-08 19:13:39,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:13:39,250 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:39,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:39,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1772973075, now seen corresponding path program 1 times [2024-11-08 19:13:39,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:39,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625738830] [2024-11-08 19:13:39,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:39,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:13:39,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:13:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:13:39,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:13:39,353 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:13:39,354 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:13:39,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:13:39,360 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:13:39,432 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:13:39,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:13:39 BoogieIcfgContainer [2024-11-08 19:13:39,438 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:13:39,438 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:13:39,438 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:13:39,439 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:13:39,439 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:13:35" (3/4) ... [2024-11-08 19:13:39,442 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:13:39,443 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:13:39,444 INFO L158 Benchmark]: Toolchain (without parser) took 6399.26ms. Allocated memory was 146.8MB in the beginning and 262.1MB in the end (delta: 115.3MB). Free memory was 98.4MB in the beginning and 104.8MB in the end (delta: -6.5MB). Peak memory consumption was 110.8MB. Max. memory is 16.1GB. [2024-11-08 19:13:39,444 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 100.7MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:13:39,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.88ms. Allocated memory is still 146.8MB. Free memory was 98.4MB in the beginning and 75.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 19:13:39,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.98ms. Allocated memory is still 146.8MB. Free memory was 75.3MB in the beginning and 60.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 19:13:39,445 INFO L158 Benchmark]: Boogie Preprocessor took 169.97ms. Allocated memory is still 146.8MB. Free memory was 60.6MB in the beginning and 52.0MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 19:13:39,447 INFO L158 Benchmark]: RCFGBuilder took 1268.52ms. Allocated memory is still 146.8MB. Free memory was 51.4MB in the beginning and 94.5MB in the end (delta: -43.1MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2024-11-08 19:13:39,447 INFO L158 Benchmark]: TraceAbstraction took 4299.29ms. Allocated memory was 146.8MB in the beginning and 262.1MB in the end (delta: 115.3MB). Free memory was 94.1MB in the beginning and 104.8MB in the end (delta: -10.7MB). Peak memory consumption was 108.8MB. Max. memory is 16.1GB. [2024-11-08 19:13:39,448 INFO L158 Benchmark]: Witness Printer took 5.15ms. Allocated memory is still 262.1MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:13:39,449 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.11ms. Allocated memory is still 100.7MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.88ms. Allocated memory is still 146.8MB. Free memory was 98.4MB in the beginning and 75.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.98ms. Allocated memory is still 146.8MB. Free memory was 75.3MB in the beginning and 60.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 169.97ms. Allocated memory is still 146.8MB. Free memory was 60.6MB in the beginning and 52.0MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1268.52ms. Allocated memory is still 146.8MB. Free memory was 51.4MB in the beginning and 94.5MB in the end (delta: -43.1MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4299.29ms. Allocated memory was 146.8MB in the beginning and 262.1MB in the end (delta: 115.3MB). Free memory was 94.1MB in the beginning and 104.8MB in the end (delta: -10.7MB). Peak memory consumption was 108.8MB. Max. memory is 16.1GB. * Witness Printer took 5.15ms. Allocated memory is still 262.1MB. Free memory is still 104.8MB. 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 169. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_33 mask_SORT_33 = (SORT_33)-1 >> (sizeof(SORT_33) * 8 - 4); [L36] const SORT_33 msb_SORT_33 = (SORT_33)1 << (4 - 1); [L38] const SORT_69 mask_SORT_69 = (SORT_69)-1 >> (sizeof(SORT_69) * 8 - 10); [L39] const SORT_69 msb_SORT_69 = (SORT_69)1 << (10 - 1); [L41] const SORT_3 var_7 = 0; [L42] const SORT_10 var_12 = 0; [L43] const SORT_1 var_14 = 0; [L44] const SORT_10 var_18 = 1; [L45] const SORT_1 var_23 = 1; [L46] const SORT_69 var_70 = 0; [L47] const SORT_10 var_113 = 104; [L49] SORT_1 input_2; [L50] SORT_3 input_4; [L51] SORT_1 input_5; [L52] SORT_1 input_6; [L53] SORT_1 input_31; [L54] SORT_33 input_34; [L55] SORT_1 input_36; [L56] SORT_33 input_38; [L57] SORT_1 input_40; [L58] SORT_1 input_42; [L59] SORT_1 input_48; [L60] SORT_1 input_50; [L61] SORT_1 input_52; [L62] SORT_1 input_57; [L63] SORT_1 input_67; [L64] SORT_3 input_75; [L65] SORT_1 input_82; [L66] SORT_1 input_89; [L67] SORT_1 input_95; [L68] SORT_1 input_101; [L69] SORT_1 input_107; [L70] SORT_1 input_108; [L71] SORT_1 input_109; [L72] SORT_1 input_126; [L73] SORT_69 input_136; [L74] SORT_1 input_144; [L75] SORT_1 input_145; [L76] SORT_1 input_146; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L78] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L79] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L80] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L81] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L82] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L83] SORT_1 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L84] SORT_1 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L85] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L86] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L87] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L88] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_ushort() & mask_SORT_69 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L89] SORT_69 state_71 = __VERIFIER_nondet_ushort() & mask_SORT_69; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L90] SORT_1 state_73 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] SORT_3 init_9_arg_1 = var_7; [L93] state_8 = init_9_arg_1 [L94] SORT_1 init_16_arg_1 = var_14; [L95] state_15 = init_16_arg_1 [L96] SORT_1 init_28_arg_1 = var_14; [L97] state_27 = init_28_arg_1 [L98] SORT_1 init_30_arg_1 = var_14; [L99] state_29 = init_30_arg_1 [L100] SORT_1 init_45_arg_1 = var_14; [L101] state_44 = init_45_arg_1 [L102] SORT_1 init_47_arg_1 = var_14; [L103] state_46 = init_47_arg_1 [L104] SORT_1 init_55_arg_1 = var_23; [L105] state_54 = init_55_arg_1 [L106] SORT_1 init_60_arg_1 = var_14; [L107] state_59 = init_60_arg_1 [L108] SORT_1 init_62_arg_1 = var_14; [L109] state_61 = init_62_arg_1 [L110] SORT_1 init_64_arg_1 = var_14; [L111] state_63 = init_64_arg_1 [L112] SORT_1 init_66_arg_1 = var_14; [L113] state_65 = init_66_arg_1 [L114] SORT_69 init_72_arg_1 = var_70; [L115] state_71 = init_72_arg_1 [L116] SORT_1 init_74_arg_1 = var_14; [L117] state_73 = init_74_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L120] input_2 = __VERIFIER_nondet_uchar() [L121] input_4 = __VERIFIER_nondet_uchar() [L122] input_5 = __VERIFIER_nondet_uchar() [L123] input_6 = __VERIFIER_nondet_uchar() [L124] input_31 = __VERIFIER_nondet_uchar() [L125] input_34 = __VERIFIER_nondet_uchar() [L126] input_36 = __VERIFIER_nondet_uchar() [L127] input_38 = __VERIFIER_nondet_uchar() [L128] input_40 = __VERIFIER_nondet_uchar() [L129] input_42 = __VERIFIER_nondet_uchar() [L130] input_48 = __VERIFIER_nondet_uchar() [L131] input_50 = __VERIFIER_nondet_uchar() [L132] input_52 = __VERIFIER_nondet_uchar() [L133] input_57 = __VERIFIER_nondet_uchar() [L134] input_67 = __VERIFIER_nondet_uchar() [L135] input_75 = __VERIFIER_nondet_uchar() [L136] input_82 = __VERIFIER_nondet_uchar() [L137] input_89 = __VERIFIER_nondet_uchar() [L138] input_95 = __VERIFIER_nondet_uchar() [L139] input_101 = __VERIFIER_nondet_uchar() [L140] input_107 = __VERIFIER_nondet_uchar() [L141] input_108 = __VERIFIER_nondet_uchar() [L142] input_109 = __VERIFIER_nondet_uchar() [L143] input_126 = __VERIFIER_nondet_uchar() [L144] input_136 = __VERIFIER_nondet_ushort() [L145] input_144 = __VERIFIER_nondet_uchar() [L146] input_145 = __VERIFIER_nondet_uchar() [L147] input_146 = __VERIFIER_nondet_uchar() [L150] SORT_3 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_11_arg_0=0, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L151] EXPR var_11_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L151] var_11_arg_0 = var_11_arg_0 & mask_SORT_3 [L152] SORT_10 var_11 = var_11_arg_0; [L153] SORT_10 var_13_arg_0 = var_11; [L154] SORT_10 var_13_arg_1 = var_12; [L155] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L156] SORT_1 var_17_arg_0 = state_15; VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_13=1, var_14=0, var_17_arg_0=0, var_18=1, var_23=1, var_70=0] [L157] EXPR var_17_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_13=1, var_14=0, var_18=1, var_23=1, var_70=0] [L157] var_17_arg_0 = var_17_arg_0 & mask_SORT_1 [L158] SORT_10 var_17 = var_17_arg_0; [L159] SORT_10 var_19_arg_0 = var_17; [L160] SORT_10 var_19_arg_1 = var_18; [L161] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L162] SORT_1 var_20_arg_0 = var_13; [L163] SORT_1 var_20_arg_1 = var_19; VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_20_arg_0=1, var_20_arg_1=0, var_23=1, var_70=0] [L164] EXPR var_20_arg_0 | var_20_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L164] SORT_1 var_20 = var_20_arg_0 | var_20_arg_1; [L165] SORT_1 var_24_arg_0 = var_20; [L166] SORT_1 var_24 = ~var_24_arg_0; [L167] SORT_1 var_25_arg_0 = var_23; [L168] SORT_1 var_25_arg_1 = var_24; VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_25_arg_0=1, var_25_arg_1=-2, var_70=0] [L169] EXPR var_25_arg_0 & var_25_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L169] SORT_1 var_25 = var_25_arg_0 & var_25_arg_1; [L170] EXPR var_25 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L170] var_25 = var_25 & mask_SORT_1 [L171] SORT_1 bad_26_arg_0 = var_25; [L172] CALL __VERIFIER_assert(!(bad_26_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 781 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 781 mSDsluCounter, 4490 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3315 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 428 IncrementalHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 1175 mSDtfsCounter, 428 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=6, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 35 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 751 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-11-08 19:13:39,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 81099e1fe8016daaefd672ebf53a7cbfe30573425760bd713b63c430b338ca02 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:13:41,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:13:41,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 19:13:41,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:13:41,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:13:42,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:13:42,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:13:42,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:13:42,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:13:42,033 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:13:42,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:13:42,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:13:42,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:13:42,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:13:42,039 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:13:42,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:13:42,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:13:42,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:13:42,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:13:42,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:13:42,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:13:42,046 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:13:42,046 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:13:42,046 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:13:42,046 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:13:42,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:13:42,047 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:13:42,047 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:13:42,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:13:42,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:13:42,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:13:42,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:13:42,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:13:42,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:13:42,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:13:42,051 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:13:42,052 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:13:42,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:13:42,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:13:42,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:13:42,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:13:42,053 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 81099e1fe8016daaefd672ebf53a7cbfe30573425760bd713b63c430b338ca02 [2024-11-08 19:13:42,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:13:42,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:13:42,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:13:42,487 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:13:42,488 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:13:42,490 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2024-11-08 19:13:44,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:13:44,286 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:13:44,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2024-11-08 19:13:44,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/949f4f4ba/5c94c9f173004368bd24845b0e8dbc76/FLAG3453646a2 [2024-11-08 19:13:44,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/949f4f4ba/5c94c9f173004368bd24845b0e8dbc76 [2024-11-08 19:13:44,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:13:44,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:13:44,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:13:44,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:13:44,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:13:44,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:13:44" (1/1) ... [2024-11-08 19:13:44,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@475aa5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:44, skipping insertion in model container [2024-11-08 19:13:44,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:13:44" (1/1) ... [2024-11-08 19:13:44,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:13:44,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c[1266,1279] [2024-11-08 19:13:44,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:13:44,778 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:13:44,792 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c[1266,1279] [2024-11-08 19:13:44,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:13:44,901 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:13:44,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:44 WrapperNode [2024-11-08 19:13:44,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:13:44,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:13:44,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:13:44,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:13:44,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:44" (1/1) ... [2024-11-08 19:13:44,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:44" (1/1) ... [2024-11-08 19:13:44,983 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 468 [2024-11-08 19:13:44,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:13:44,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:13:44,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:13:44,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:13:45,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:44" (1/1) ... [2024-11-08 19:13:45,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:44" (1/1) ... [2024-11-08 19:13:45,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:44" (1/1) ... [2024-11-08 19:13:45,044 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:13:45,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:44" (1/1) ... [2024-11-08 19:13:45,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:44" (1/1) ... [2024-11-08 19:13:45,067 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:44" (1/1) ... [2024-11-08 19:13:45,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:44" (1/1) ... [2024-11-08 19:13:45,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:44" (1/1) ... [2024-11-08 19:13:45,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:44" (1/1) ... [2024-11-08 19:13:45,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:13:45,093 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:13:45,093 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:13:45,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:13:45,095 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:44" (1/1) ... [2024-11-08 19:13:45,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:13:45,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:13:45,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:13:45,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:13:45,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:13:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:13:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:13:45,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:13:45,340 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:13:45,342 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:13:45,791 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-11-08 19:13:45,792 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:13:45,804 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:13:45,806 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:13:45,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:13:45 BoogieIcfgContainer [2024-11-08 19:13:45,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:13:45,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:13:45,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:13:45,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:13:45,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:13:44" (1/3) ... [2024-11-08 19:13:45,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0b735b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:13:45, skipping insertion in model container [2024-11-08 19:13:45,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:44" (2/3) ... [2024-11-08 19:13:45,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0b735b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:13:45, skipping insertion in model container [2024-11-08 19:13:45,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:13:45" (3/3) ... [2024-11-08 19:13:45,820 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2024-11-08 19:13:45,839 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:13:45,839 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:13:45,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:13:45,911 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;@171e5703, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:13:45,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:13:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 19:13:45,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:45,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 19:13:45,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:45,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:45,934 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 19:13:45,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:13:45,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931396368] [2024-11-08 19:13:45,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:45,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:13:45,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:13:45,953 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:13:45,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 19:13:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:46,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 19:13:46,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:13:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:46,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:13:46,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:13:46,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931396368] [2024-11-08 19:13:46,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931396368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:46,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:46,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:13:46,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534524663] [2024-11-08 19:13:46,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:46,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:13:46,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:13:46,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:13:46,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:46,396 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:46,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:46,461 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-08 19:13:46,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:13:46,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-08 19:13:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:46,473 INFO L225 Difference]: With dead ends: 18 [2024-11-08 19:13:46,473 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 19:13:46,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:13:46,482 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:46,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:13:46,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 19:13:46,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 19:13:46,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 19:13:46,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 19:13:46,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:46,514 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 19:13:46,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 19:13:46,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 19:13:46,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:46,514 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 19:13:46,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 19:13:46,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:13:46,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:46,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:46,721 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-08 19:13:46,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:13:46,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84959318] [2024-11-08 19:13:46,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:46,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:13:46,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:13:46,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:13:46,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 19:13:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:46,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 19:13:46,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:13:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:47,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:13:52,912 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse3 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_0~0#1_10| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_10|)))))))))))) (_ bv0 8)))) (.cse2 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_10|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_0~0#1_10|))))))))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_8~0#1|))))) (let ((.cse9 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_46~0#1|)) (.cse11 (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|))))))))) (.cse12 (or .cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|))))))))) (let ((.cse7 (forall ((|ULTIMATE.start_main_~var_23~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_23~0#1|)))))))))))) (.cse10 (and .cse11 .cse12)) (.cse5 (or (and (or .cse2 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|)))))))))))))) (or .cse3 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|)))))))))))))) .cse9)) (.cse8 (forall ((|ULTIMATE.start_main_~var_23~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_23~0#1|)))))))))))) (and (or (forall ((|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)))))))))) (let ((.cse4 (or (not .cse9) .cse10))) (and (or (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse6)))))) (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|)))) |c_ULTIMATE.start_main_~var_12~0#1|))) .cse2) (or (forall ((|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|)))) |c_ULTIMATE.start_main_~var_12~0#1|)) .cse3) .cse4 .cse5)) .cse7) (or (and .cse4 .cse5) .cse8)))) (or (and (or .cse7 .cse10) (or (and .cse11 .cse12 .cse5) .cse8)) (forall ((|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))))))))))))))))) is different from false [2024-11-08 19:13:53,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-08 19:13:53,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:13:53,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84959318] [2024-11-08 19:13:53,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84959318] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:13:53,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:13:53,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-08 19:13:53,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123454280] [2024-11-08 19:13:53,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:13:53,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 19:13:53,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:13:53,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 19:13:53,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-08 19:13:53,737 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:53,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:53,888 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-08 19:13:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:13:53,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-08 19:13:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:53,889 INFO L225 Difference]: With dead ends: 15 [2024-11-08 19:13:53,890 INFO L226 Difference]: Without dead ends: 13 [2024-11-08 19:13:53,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=31, Invalid=44, Unknown=1, NotChecked=14, Total=90 [2024-11-08 19:13:53,891 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:53,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2024-11-08 19:13:53,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-08 19:13:53,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-08 19:13:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:53,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-08 19:13:53,898 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-08 19:13:53,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:53,899 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-08 19:13:53,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:53,899 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-08 19:13:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:13:53,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:53,900 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-08 19:13:53,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 19:13:54,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:13:54,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:54,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-08 19:13:54,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:13:54,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782858483] [2024-11-08 19:13:54,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 19:13:54,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:13:54,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:13:54,106 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:13:54,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 19:13:54,329 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 19:13:54,330 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:13:54,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 19:13:54,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:13:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:54,754 INFO L311 TraceCheckSpWp]: Computing backward predicates...