./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 275f3564868260c0f8bba92723013207b6a72ca364aead8f492ecb284c649797 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:27:16,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:27:16,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 06:27:16,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:27:16,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:27:16,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:27:16,703 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:27:16,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:27:16,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:27:16,705 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:27:16,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:27:16,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:27:16,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:27:16,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:27:16,709 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:27:16,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:27:16,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:27:16,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 06:27:16,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:27:16,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:27:16,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:27:16,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:27:16,712 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:27:16,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:27:16,713 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:27:16,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:27:16,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:27:16,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:27:16,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:27:16,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:27:16,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:27:16,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:27:16,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:27:16,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 06:27:16,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 06:27:16,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:27:16,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:27:16,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:27:16,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:27:16,718 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 275f3564868260c0f8bba92723013207b6a72ca364aead8f492ecb284c649797 [2024-10-11 06:27:16,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:27:17,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:27:17,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:27:17,024 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:27:17,025 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:27:17,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c [2024-10-11 06:27:18,583 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:27:18,798 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:27:18,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c [2024-10-11 06:27:18,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f96242c20/419e107f995a46cabcd2ff30de5c8099/FLAGa0c228717 [2024-10-11 06:27:18,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f96242c20/419e107f995a46cabcd2ff30de5c8099 [2024-10-11 06:27:18,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:27:18,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:27:18,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:27:18,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:27:18,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:27:18,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:27:18" (1/1) ... [2024-10-11 06:27:18,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3b636d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:18, skipping insertion in model container [2024-10-11 06:27:18,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:27:18" (1/1) ... [2024-10-11 06:27:18,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:27:19,074 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c[1298,1311] [2024-10-11 06:27:19,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:27:19,168 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:27:19,183 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c[1298,1311] [2024-10-11 06:27:19,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:27:19,246 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:27:19,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:19 WrapperNode [2024-10-11 06:27:19,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:27:19,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:27:19,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:27:19,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:27:19,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:19" (1/1) ... [2024-10-11 06:27:19,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:19" (1/1) ... [2024-10-11 06:27:19,324 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 373 [2024-10-11 06:27:19,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:27:19,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:27:19,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:27:19,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:27:19,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:19" (1/1) ... [2024-10-11 06:27:19,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:19" (1/1) ... [2024-10-11 06:27:19,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:19" (1/1) ... [2024-10-11 06:27:19,371 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-11 06:27:19,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:19" (1/1) ... [2024-10-11 06:27:19,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:19" (1/1) ... [2024-10-11 06:27:19,386 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:19" (1/1) ... [2024-10-11 06:27:19,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:19" (1/1) ... [2024-10-11 06:27:19,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:19" (1/1) ... [2024-10-11 06:27:19,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:19" (1/1) ... [2024-10-11 06:27:19,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:27:19,416 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:27:19,416 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:27:19,416 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:27:19,417 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:19" (1/1) ... [2024-10-11 06:27:19,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:27:19,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:27:19,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:27:19,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:27:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:27:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 06:27:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 06:27:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:27:19,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:27:19,630 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:27:19,633 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:27:20,321 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-10-11 06:27:20,321 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:27:20,357 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:27:20,358 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:27:20,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:27:20 BoogieIcfgContainer [2024-10-11 06:27:20,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:27:20,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:27:20,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:27:20,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:27:20,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:27:18" (1/3) ... [2024-10-11 06:27:20,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218dbede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:27:20, skipping insertion in model container [2024-10-11 06:27:20,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:19" (2/3) ... [2024-10-11 06:27:20,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218dbede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:27:20, skipping insertion in model container [2024-10-11 06:27:20,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:27:20" (3/3) ... [2024-10-11 06:27:20,369 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul2.c [2024-10-11 06:27:20,389 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:27:20,390 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:27:20,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:27:20,456 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;@638ea79d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:27:20,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:27:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 89 states have (on average 1.5056179775280898) internal successors, (134), 90 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:27:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 06:27:20,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:27:20,468 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] [2024-10-11 06:27:20,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:27:20,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:27:20,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1782577207, now seen corresponding path program 1 times [2024-10-11 06:27:20,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:27:20,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739102802] [2024-10-11 06:27:20,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:27:20,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:27:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:27:21,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:27:21,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:27:21,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739102802] [2024-10-11 06:27:21,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739102802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:27:21,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:27:21,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:27:21,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320804160] [2024-10-11 06:27:21,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:27:21,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:27:21,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:27:21,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:27:21,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:27:21,170 INFO L87 Difference]: Start difference. First operand has 91 states, 89 states have (on average 1.5056179775280898) internal successors, (134), 90 states have internal predecessors, (134), 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 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:27:21,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:27:21,229 INFO L93 Difference]: Finished difference Result 150 states and 222 transitions. [2024-10-11 06:27:21,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:27:21,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2024-10-11 06:27:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:27:21,243 INFO L225 Difference]: With dead ends: 150 [2024-10-11 06:27:21,244 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 06:27:21,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:27:21,251 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:27:21,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:27:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 06:27:21,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 06:27:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 91 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:27:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-10-11 06:27:21,331 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 30 [2024-10-11 06:27:21,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:27:21,332 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-10-11 06:27:21,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:27:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-10-11 06:27:21,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 06:27:21,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:27:21,335 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] [2024-10-11 06:27:21,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 06:27:21,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:27:21,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:27:21,338 INFO L85 PathProgramCache]: Analyzing trace with hash 576376753, now seen corresponding path program 1 times [2024-10-11 06:27:21,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:27:21,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264421377] [2024-10-11 06:27:21,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:27:21,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:27:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:27:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:27:21,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:27:21,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264421377] [2024-10-11 06:27:21,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264421377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:27:21,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:27:21,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:27:21,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983381860] [2024-10-11 06:27:21,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:27:21,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:27:21,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:27:21,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:27:21,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:27:21,563 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:27:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:27:21,606 INFO L93 Difference]: Finished difference Result 153 states and 222 transitions. [2024-10-11 06:27:21,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:27:21,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2024-10-11 06:27:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:27:21,611 INFO L225 Difference]: With dead ends: 153 [2024-10-11 06:27:21,611 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 06:27:21,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:27:21,613 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:27:21,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:27:21,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 06:27:21,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 06:27:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 93 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:27:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-11 06:27:21,627 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 31 [2024-10-11 06:27:21,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:27:21,628 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-11 06:27:21,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:27:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-11 06:27:21,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 06:27:21,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:27:21,633 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] [2024-10-11 06:27:21,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 06:27:21,633 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:27:21,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:27:21,634 INFO L85 PathProgramCache]: Analyzing trace with hash -410155614, now seen corresponding path program 1 times [2024-10-11 06:27:21,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:27:21,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430464615] [2024-10-11 06:27:21,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:27:21,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:27:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:27:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:27:21,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:27:21,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430464615] [2024-10-11 06:27:21,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430464615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:27:21,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:27:21,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 06:27:21,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97197876] [2024-10-11 06:27:21,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:27:21,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:27:21,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:27:21,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:27:21,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:27:21,958 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:27:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:27:22,020 INFO L93 Difference]: Finished difference Result 153 states and 221 transitions. [2024-10-11 06:27:22,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:27:22,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 32 [2024-10-11 06:27:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:27:22,024 INFO L225 Difference]: With dead ends: 153 [2024-10-11 06:27:22,024 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 06:27:22,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:27:22,026 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 108 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:27:22,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 246 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:27:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 06:27:22,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 06:27:22,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4505494505494505) internal successors, (132), 91 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:27:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-10-11 06:27:22,038 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 32 [2024-10-11 06:27:22,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:27:22,039 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-10-11 06:27:22,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:27:22,039 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-10-11 06:27:22,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 06:27:22,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:27:22,040 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] [2024-10-11 06:27:22,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 06:27:22,041 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:27:22,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:27:22,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1734623124, now seen corresponding path program 1 times [2024-10-11 06:27:22,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:27:22,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859142143] [2024-10-11 06:27:22,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:27:22,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:27:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:27:22,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 06:27:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:27:22,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 06:27:22,184 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 06:27:22,186 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 06:27:22,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 06:27:22,192 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 06:27:22,243 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 06:27:22,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:27:22 BoogieIcfgContainer [2024-10-11 06:27:22,252 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 06:27:22,253 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 06:27:22,253 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 06:27:22,253 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 06:27:22,254 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:27:20" (3/4) ... [2024-10-11 06:27:22,256 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 06:27:22,257 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 06:27:22,258 INFO L158 Benchmark]: Toolchain (without parser) took 3428.36ms. Allocated memory was 169.9MB in the beginning and 232.8MB in the end (delta: 62.9MB). Free memory was 115.4MB in the beginning and 90.5MB in the end (delta: 24.9MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. [2024-10-11 06:27:22,259 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 169.9MB. Free memory was 132.6MB in the beginning and 132.4MB in the end (delta: 244.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:27:22,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.86ms. Allocated memory is still 169.9MB. Free memory was 115.4MB in the beginning and 99.3MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 06:27:22,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.93ms. Allocated memory is still 169.9MB. Free memory was 99.3MB in the beginning and 93.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 06:27:22,259 INFO L158 Benchmark]: Boogie Preprocessor took 89.39ms. Allocated memory is still 169.9MB. Free memory was 93.9MB in the beginning and 89.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 06:27:22,260 INFO L158 Benchmark]: RCFGBuilder took 942.87ms. Allocated memory is still 169.9MB. Free memory was 89.8MB in the beginning and 115.1MB in the end (delta: -25.4MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-10-11 06:27:22,260 INFO L158 Benchmark]: TraceAbstraction took 1891.01ms. Allocated memory was 169.9MB in the beginning and 232.8MB in the end (delta: 62.9MB). Free memory was 114.3MB in the beginning and 90.5MB in the end (delta: 23.8MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. [2024-10-11 06:27:22,260 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 232.8MB. Free memory is still 90.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:27:22,262 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.22ms. Allocated memory is still 169.9MB. Free memory was 132.6MB in the beginning and 132.4MB in the end (delta: 244.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.86ms. Allocated memory is still 169.9MB. Free memory was 115.4MB in the beginning and 99.3MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.93ms. Allocated memory is still 169.9MB. Free memory was 99.3MB in the beginning and 93.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.39ms. Allocated memory is still 169.9MB. Free memory was 93.9MB in the beginning and 89.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 942.87ms. Allocated memory is still 169.9MB. Free memory was 89.8MB in the beginning and 115.1MB in the end (delta: -25.4MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1891.01ms. Allocated memory was 169.9MB in the beginning and 232.8MB in the end (delta: 62.9MB). Free memory was 114.3MB in the beginning and 90.5MB in the end (delta: 23.8MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 232.8MB. Free memory is still 90.5MB. 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: 22]: 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 92. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 64); [L31] const SORT_5 msb_SORT_5 = (SORT_5)1 << (64 - 1); [L33] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 128); [L34] const SORT_9 msb_SORT_9 = (SORT_9)1 << (128 - 1); [L36] const SORT_9 var_10 = 0; [L37] const SORT_1 var_18 = 1; [L38] const SORT_5 var_22 = 0; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L42] SORT_1 input_4; [L43] SORT_5 input_6; [L44] SORT_5 input_7; [L45] SORT_1 input_8; [L47] EXPR __VERIFIER_nondet_uint128() & mask_SORT_9 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L47] SORT_9 state_11 = __VERIFIER_nondet_uint128() & mask_SORT_9; [L48] EXPR __VERIFIER_nondet_uint128() & mask_SORT_9 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L48] SORT_9 state_13 = __VERIFIER_nondet_uint128() & mask_SORT_9; [L49] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L49] SORT_5 state_23 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L50] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L50] SORT_5 state_25 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L51] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L52] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L53] SORT_5 state_31 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L54] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L54] SORT_5 state_33 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L56] SORT_9 init_12_arg_1 = var_10; [L57] state_11 = init_12_arg_1 [L58] SORT_9 init_14_arg_1 = var_10; [L59] state_13 = init_14_arg_1 [L60] SORT_5 init_24_arg_1 = var_22; [L61] state_23 = init_24_arg_1 [L62] SORT_5 init_26_arg_1 = var_22; [L63] state_25 = init_26_arg_1 [L64] SORT_1 init_28_arg_1 = var_18; [L65] state_27 = init_28_arg_1 [L66] SORT_1 init_30_arg_1 = var_18; [L67] state_29 = init_30_arg_1 [L68] SORT_5 init_32_arg_1 = var_22; [L69] state_31 = init_32_arg_1 [L70] SORT_5 init_34_arg_1 = var_22; [L71] state_33 = init_34_arg_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_3 = __VERIFIER_nondet_uchar() [L76] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L76] input_3 = input_3 & mask_SORT_1 [L77] input_4 = __VERIFIER_nondet_uchar() [L78] EXPR input_4 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L78] input_4 = input_4 & mask_SORT_1 [L79] input_6 = __VERIFIER_nondet_ulong() [L80] input_7 = __VERIFIER_nondet_ulong() [L81] input_8 = __VERIFIER_nondet_uchar() [L82] EXPR input_8 & mask_SORT_1 VAL [input_3=0, input_4=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L82] input_8 = input_8 & mask_SORT_1 [L85] SORT_9 var_15_arg_0 = state_11; [L86] SORT_9 var_15_arg_1 = state_13; [L87] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L88] SORT_1 var_19_arg_0 = var_15; [L89] SORT_1 var_19 = ~var_19_arg_0; [L90] SORT_1 var_20_arg_0 = var_18; [L91] SORT_1 var_20_arg_1 = var_19; VAL [input_3=0, input_4=0, input_8=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_22=0] [L92] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_3=0, input_4=0, input_8=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L92] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L93] EXPR var_20 & mask_SORT_1 VAL [input_3=0, input_4=0, input_8=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L93] var_20 = var_20 & mask_SORT_1 [L94] SORT_1 bad_21_arg_0 = var_20; [L95] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 1007 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 626 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 381 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 06:27:22,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 275f3564868260c0f8bba92723013207b6a72ca364aead8f492ecb284c649797 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:27:24,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:27:24,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 06:27:24,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:27:24,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:27:24,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:27:24,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:27:24,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:27:24,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:27:24,974 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:27:24,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:27:24,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:27:24,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:27:24,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:27:24,978 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:27:24,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:27:24,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:27:24,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:27:24,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:27:24,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:27:24,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:27:24,983 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 06:27:24,984 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 06:27:24,984 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:27:24,984 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 06:27:24,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:27:24,984 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:27:24,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:27:24,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:27:24,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:27:24,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:27:24,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:27:24,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:27:24,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:27:24,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:27:24,986 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 06:27:24,987 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 06:27:24,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:27:24,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:27:24,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:27:24,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:27:24,990 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 06:27:24,990 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 275f3564868260c0f8bba92723013207b6a72ca364aead8f492ecb284c649797 [2024-10-11 06:27:25,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:27:25,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:27:25,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:27:25,403 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:27:25,404 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:27:25,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c [2024-10-11 06:27:27,163 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:27:27,423 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:27:27,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c [2024-10-11 06:27:27,433 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/155ecc5f0/e6033bc6db9d49d89257e6ee475b36a3/FLAGc9da56b26 [2024-10-11 06:27:27,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/155ecc5f0/e6033bc6db9d49d89257e6ee475b36a3 [2024-10-11 06:27:27,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:27:27,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:27:27,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:27:27,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:27:27,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:27:27,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:27:27" (1/1) ... [2024-10-11 06:27:27,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2145ba06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:27, skipping insertion in model container [2024-10-11 06:27:27,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:27:27" (1/1) ... [2024-10-11 06:27:27,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:27:27,710 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c[1298,1311] [2024-10-11 06:27:27,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:27:27,797 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:27:27,816 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c[1298,1311] [2024-10-11 06:27:27,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:27:27,863 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:27:27,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:27 WrapperNode [2024-10-11 06:27:27,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:27:27,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:27:27,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:27:27,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:27:27,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:27" (1/1) ... [2024-10-11 06:27:27,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:27" (1/1) ... [2024-10-11 06:27:27,928 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 205 [2024-10-11 06:27:27,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:27:27,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:27:27,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:27:27,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:27:27,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:27" (1/1) ... [2024-10-11 06:27:27,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:27" (1/1) ... [2024-10-11 06:27:27,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:27" (1/1) ... [2024-10-11 06:27:27,986 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-11 06:27:27,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:27" (1/1) ... [2024-10-11 06:27:27,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:27" (1/1) ... [2024-10-11 06:27:28,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:27" (1/1) ... [2024-10-11 06:27:28,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:27" (1/1) ... [2024-10-11 06:27:28,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:27" (1/1) ... [2024-10-11 06:27:28,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:27" (1/1) ... [2024-10-11 06:27:28,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:27:28,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:27:28,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:27:28,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:27:28,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:27" (1/1) ... [2024-10-11 06:27:28,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:27:28,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:27:28,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:27:28,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:27:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:27:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 06:27:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 06:27:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:27:28,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:27:28,263 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:27:28,266 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:27:29,716 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-11 06:27:29,716 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:27:29,762 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:27:29,762 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:27:29,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:27:29 BoogieIcfgContainer [2024-10-11 06:27:29,767 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:27:29,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:27:29,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:27:29,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:27:29,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:27:27" (1/3) ... [2024-10-11 06:27:29,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766b5d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:27:29, skipping insertion in model container [2024-10-11 06:27:29,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:27" (2/3) ... [2024-10-11 06:27:29,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766b5d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:27:29, skipping insertion in model container [2024-10-11 06:27:29,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:27:29" (3/3) ... [2024-10-11 06:27:29,781 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul2.c [2024-10-11 06:27:29,801 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:27:29,801 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:27:29,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:27:29,885 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;@79a963dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:27:29,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:27:29,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:27:29,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 06:27:29,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:27:29,901 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 06:27:29,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:27:29,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:27:29,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 06:27:29,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:27:29,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434113414] [2024-10-11 06:27:29,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:27:29,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:27:29,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:27:29,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:27:29,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 06:27:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:27:30,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 06:27:30,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:27:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:27:30,510 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:27:30,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:27:30,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434113414] [2024-10-11 06:27:30,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434113414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:27:30,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:27:30,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 06:27:30,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409810167] [2024-10-11 06:27:30,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:27:30,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:27:30,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:27:30,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:27:30,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:27:30,549 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:27:32,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 06:27:32,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:27:32,149 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-11 06:27:32,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:27:32,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 06:27:32,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:27:32,160 INFO L225 Difference]: With dead ends: 14 [2024-10-11 06:27:32,160 INFO L226 Difference]: Without dead ends: 8 [2024-10-11 06:27:32,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:27:32,168 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 06:27:32,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 06:27:32,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-11 06:27:32,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-11 06:27:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:27:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 06:27:32,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 06:27:32,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:27:32,199 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 06:27:32,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:27:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 06:27:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 06:27:32,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:27:32,200 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 06:27:32,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 06:27:32,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:27:32,404 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:27:32,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:27:32,405 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 06:27:32,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:27:32,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337908069] [2024-10-11 06:27:32,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:27:32,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:27:32,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:27:32,407 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:27:32,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 06:27:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:27:32,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 06:27:32,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:27:33,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:27:33,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:27:56,486 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_29~0#1|))) (let ((.cse1 (forall ((|ULTIMATE.start_main_~state_27~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |ULTIMATE.start_main_~state_27~0#1|) .cse3))))) (_ bv0 8))))) (.cse2 (forall ((|ULTIMATE.start_main_~state_27~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |ULTIMATE.start_main_~state_27~0#1|) .cse3))))) (_ bv0 8))))) (and (or (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_16|)))))))) (and .cse1 .cse2)) (or (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_16|)))))))) (and (or .cse1 (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 64))) (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| |ULTIMATE.start_main_~state_13~0#1|) (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |ULTIMATE.start_main_~mask_SORT_5~0#1| |ULTIMATE.start_main_~state_25~0#1|))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64)) (|ULTIMATE.start_main_~state_31~0#1| (_ BitVec 64)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 64))) (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |ULTIMATE.start_main_~mask_SORT_5~0#1| |ULTIMATE.start_main_~state_25~0#1|)))) (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| (bvmul ((_ zero_extend 64) (bvand |ULTIMATE.start_main_~mask_SORT_5~0#1| |ULTIMATE.start_main_~state_31~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_33~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)))))) .cse2)))))) is different from true [2024-10-11 06:28:07,313 WARN L286 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 06:28:08,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 06:28:08,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:28:08,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337908069] [2024-10-11 06:28:08,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337908069] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:28:08,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 06:28:08,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 06:28:08,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301800936] [2024-10-11 06:28:08,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 06:28:08,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:28:08,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:28:08,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:28:08,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2024-10-11 06:28:08,991 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:28:19,235 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_29~0#1|))) (let ((.cse1 (forall ((|ULTIMATE.start_main_~state_27~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |ULTIMATE.start_main_~state_27~0#1|) .cse3))))) (_ bv0 8))))) (.cse2 (forall ((|ULTIMATE.start_main_~state_27~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |ULTIMATE.start_main_~state_27~0#1|) .cse3))))) (_ bv0 8))))) (and (= |c_ULTIMATE.start_main_~mask_SORT_1~0#1| (_ bv1 8)) (= |c_ULTIMATE.start_main_~var_10~0#1| (_ bv0 128)) (= (_ bv1 8) |c_ULTIMATE.start_main_~state_29~0#1|) (or (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_16|)))))))) (and .cse1 .cse2)) (= (_ bv0 64) |c_ULTIMATE.start_main_~state_23~0#1|) (= (_ bv0 64) |c_ULTIMATE.start_main_~state_33~0#1|) (or (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_16|)))))))) (and (or .cse1 (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 64))) (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| |ULTIMATE.start_main_~state_13~0#1|) (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |ULTIMATE.start_main_~mask_SORT_5~0#1| |ULTIMATE.start_main_~state_25~0#1|))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64)) (|ULTIMATE.start_main_~state_31~0#1| (_ BitVec 64)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 64))) (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |ULTIMATE.start_main_~mask_SORT_5~0#1| |ULTIMATE.start_main_~state_25~0#1|)))) (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| (bvmul ((_ zero_extend 64) (bvand |ULTIMATE.start_main_~mask_SORT_5~0#1| |ULTIMATE.start_main_~state_31~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_33~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)))))) .cse2)))))) is different from true [2024-10-11 06:28:20,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 06:28:20,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:28:20,846 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-11 06:28:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:28:20,847 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 06:28:20,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:28:20,854 INFO L225 Difference]: With dead ends: 13 [2024-10-11 06:28:20,855 INFO L226 Difference]: Without dead ends: 11 [2024-10-11 06:28:20,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=27, Invalid=51, Unknown=2, NotChecked=30, Total=110 [2024-10-11 06:28:20,857 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 06:28:20,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 12 Unchecked, 1.7s Time] [2024-10-11 06:28:20,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-11 06:28:20,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-11 06:28:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-10-11 06:28:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-11 06:28:20,861 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-11 06:28:20,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:28:20,862 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-11 06:28:20,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:28:20,862 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-11 06:28:20,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 06:28:20,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:28:20,863 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-11 06:28:20,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 06:28:21,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:28:21,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:28:21,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:28:21,065 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-11 06:28:21,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:28:21,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933274839] [2024-10-11 06:28:21,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 06:28:21,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:28:21,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:28:21,071 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:28:21,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 06:28:21,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 06:28:21,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 06:28:22,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 06:28:22,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:28:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:28:43,193 INFO L311 TraceCheckSpWp]: Computing backward predicates...