./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0acb12ce5c1df780b96c69890f213c2ccd377bcb999df28d010d244cee6d0555 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:26:29,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:26:29,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 02:26:29,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:26:29,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:26:29,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:26:29,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:26:29,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:26:29,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:26:29,192 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:26:29,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:26:29,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:26:29,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:26:29,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:26:29,195 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:26:29,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:26:29,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:26:29,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 02:26:29,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:26:29,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:26:29,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:26:29,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:26:29,202 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:26:29,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:26:29,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:26:29,202 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:26:29,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:26:29,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:26:29,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:26:29,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:26:29,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:26:29,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:26:29,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:26:29,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 02:26:29,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 02:26:29,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:26:29,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:26:29,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:26:29,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:26:29,205 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0acb12ce5c1df780b96c69890f213c2ccd377bcb999df28d010d244cee6d0555 [2024-11-10 02:26:29,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:26:29,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:26:29,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:26:29,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:26:29,491 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:26:29,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul1.c [2024-11-10 02:26:30,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:26:31,086 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:26:31,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul1.c [2024-11-10 02:26:31,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0c04d09c/62d9527d53a74735b2d256cec9f8e735/FLAG58bb20201 [2024-11-10 02:26:31,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0c04d09c/62d9527d53a74735b2d256cec9f8e735 [2024-11-10 02:26:31,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:26:31,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:26:31,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:26:31,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:26:31,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:26:31,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:26:31" (1/1) ... [2024-11-10 02:26:31,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@101e739d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:31, skipping insertion in model container [2024-11-10 02:26:31,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:26:31" (1/1) ... [2024-11-10 02:26:31,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:26:31,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul1.c[1244,1257] [2024-11-10 02:26:31,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:26:31,516 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:26:31,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul1.c[1244,1257] [2024-11-10 02:26:31,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:26:31,578 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:26:31,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:31 WrapperNode [2024-11-10 02:26:31,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:26:31,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:26:31,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:26:31,581 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:26:31,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:31" (1/1) ... [2024-11-10 02:26:31,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:31" (1/1) ... [2024-11-10 02:26:31,655 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 372 [2024-11-10 02:26:31,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:26:31,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:26:31,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:26:31,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:26:31,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:31" (1/1) ... [2024-11-10 02:26:31,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:31" (1/1) ... [2024-11-10 02:26:31,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:31" (1/1) ... [2024-11-10 02:26:31,695 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-11-10 02:26:31,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:31" (1/1) ... [2024-11-10 02:26:31,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:31" (1/1) ... [2024-11-10 02:26:31,708 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:31" (1/1) ... [2024-11-10 02:26:31,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:31" (1/1) ... [2024-11-10 02:26:31,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:31" (1/1) ... [2024-11-10 02:26:31,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:31" (1/1) ... [2024-11-10 02:26:31,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:26:31,726 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:26:31,726 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:26:31,726 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:26:31,727 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:31" (1/1) ... [2024-11-10 02:26:31,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:26:31,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:26:31,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 02:26:31,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 02:26:31,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:26:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 02:26:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 02:26:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:26:31,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:26:31,947 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:26:31,951 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:26:32,471 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-11-10 02:26:32,472 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:26:32,512 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:26:32,513 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:26:32,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:26:32 BoogieIcfgContainer [2024-11-10 02:26:32,515 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:26:32,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:26:32,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:26:32,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:26:32,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:26:31" (1/3) ... [2024-11-10 02:26:32,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1976b0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:26:32, skipping insertion in model container [2024-11-10 02:26:32,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:31" (2/3) ... [2024-11-10 02:26:32,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1976b0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:26:32, skipping insertion in model container [2024-11-10 02:26:32,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:26:32" (3/3) ... [2024-11-10 02:26:32,526 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul1.c [2024-11-10 02:26:32,544 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:26:32,545 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:26:32,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:26:32,613 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;@6362cfa2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:26:32,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:26:32,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 96 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:32,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 02:26:32,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:32,627 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-11-10 02:26:32,628 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:32,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:32,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1928115689, now seen corresponding path program 1 times [2024-11-10 02:26:32,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:32,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120090618] [2024-11-10 02:26:32,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:32,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:33,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:33,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120090618] [2024-11-10 02:26:33,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120090618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:33,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:33,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:26:33,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210983611] [2024-11-10 02:26:33,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:33,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:26:33,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:33,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:26:33,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:26:33,300 INFO L87 Difference]: Start difference. First operand has 97 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 96 states have internal predecessors, (140), 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 8.0) internal successors, (32), 4 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-11-10 02:26:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:33,423 INFO L93 Difference]: Finished difference Result 157 states and 229 transitions. [2024-11-10 02:26:33,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:26:33,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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-11-10 02:26:33,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:33,432 INFO L225 Difference]: With dead ends: 157 [2024-11-10 02:26:33,432 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 02:26:33,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:26:33,437 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:33,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:26:33,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 02:26:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 02:26:33,466 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-11-10 02:26:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-11-10 02:26:33,469 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 32 [2024-11-10 02:26:33,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:33,470 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-11-10 02:26:33,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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-11-10 02:26:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-11-10 02:26:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 02:26:33,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:33,473 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-11-10 02:26:33,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 02:26:33,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:33,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:33,474 INFO L85 PathProgramCache]: Analyzing trace with hash 503009218, now seen corresponding path program 1 times [2024-11-10 02:26:33,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:33,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172940736] [2024-11-10 02:26:33,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:33,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:33,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:33,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172940736] [2024-11-10 02:26:33,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172940736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:33,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:33,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:26:33,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338182698] [2024-11-10 02:26:33,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:33,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:26:33,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:33,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:26:33,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:26:33,631 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:33,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:33,718 INFO L93 Difference]: Finished difference Result 156 states and 225 transitions. [2024-11-10 02:26:33,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:26:33,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-11-10 02:26:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:33,720 INFO L225 Difference]: With dead ends: 156 [2024-11-10 02:26:33,720 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 02:26:33,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:26:33,723 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:33,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:26:33,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 02:26:33,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 02:26:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 95 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-10 02:26:33,734 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 33 [2024-11-10 02:26:33,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:33,734 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-10 02:26:33,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-10 02:26:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 02:26:33,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:33,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:26:33,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 02:26:33,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:33,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:33,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1839339812, now seen corresponding path program 1 times [2024-11-10 02:26:33,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:33,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166508413] [2024-11-10 02:26:33,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:33,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:34,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:34,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166508413] [2024-11-10 02:26:34,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166508413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:34,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:34,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:26:34,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620389844] [2024-11-10 02:26:34,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:34,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:26:34,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:34,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:26:34,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:26:34,021 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:34,114 INFO L93 Difference]: Finished difference Result 156 states and 224 transitions. [2024-11-10 02:26:34,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:26:34,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-10 02:26:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:34,116 INFO L225 Difference]: With dead ends: 156 [2024-11-10 02:26:34,116 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 02:26:34,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:26:34,120 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 109 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:34,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 212 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:26:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 02:26:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 02:26:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 93 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-11-10 02:26:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-11-10 02:26:34,132 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 34 [2024-11-10 02:26:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:34,132 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-11-10 02:26:34,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-11-10 02:26:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 02:26:34,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:34,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:26:34,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 02:26:34,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:34,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:34,138 INFO L85 PathProgramCache]: Analyzing trace with hash 364567580, now seen corresponding path program 1 times [2024-11-10 02:26:34,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:34,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140660675] [2024-11-10 02:26:34,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:34,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 02:26:34,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 02:26:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 02:26:34,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 02:26:34,274 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 02:26:34,275 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 02:26:34,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 02:26:34,281 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 02:26:34,328 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 02:26:34,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:26:34 BoogieIcfgContainer [2024-11-10 02:26:34,335 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 02:26:34,336 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 02:26:34,336 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 02:26:34,336 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 02:26:34,337 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:26:32" (3/4) ... [2024-11-10 02:26:34,339 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 02:26:34,340 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 02:26:34,341 INFO L158 Benchmark]: Toolchain (without parser) took 3228.10ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 64.2MB in the end (delta: 44.4MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2024-11-10 02:26:34,342 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 96.5MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:26:34,343 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.33ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 136.5MB in the end (delta: -27.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 02:26:34,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.57ms. Allocated memory is still 167.8MB. Free memory was 136.5MB in the beginning and 131.0MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 02:26:34,344 INFO L158 Benchmark]: Boogie Preprocessor took 69.03ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 127.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 02:26:34,347 INFO L158 Benchmark]: IcfgBuilder took 789.49ms. Allocated memory is still 167.8MB. Free memory was 127.3MB in the beginning and 84.8MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-10 02:26:34,347 INFO L158 Benchmark]: TraceAbstraction took 1817.38ms. Allocated memory is still 167.8MB. Free memory was 84.0MB in the beginning and 64.2MB in the end (delta: 19.8MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-10 02:26:34,348 INFO L158 Benchmark]: Witness Printer took 4.82ms. Allocated memory is still 167.8MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:26:34,349 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.76ms. Allocated memory is still 96.5MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 466.33ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 136.5MB in the end (delta: -27.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.57ms. Allocated memory is still 167.8MB. Free memory was 136.5MB in the beginning and 131.0MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.03ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 127.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 789.49ms. Allocated memory is still 167.8MB. Free memory was 127.3MB in the beginning and 84.8MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1817.38ms. Allocated memory is still 167.8MB. Free memory was 84.0MB in the beginning and 64.2MB in the end (delta: 19.8MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Witness Printer took 4.82ms. Allocated memory is still 167.8MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 91. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1); [L32] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 64); [L33] const SORT_9 msb_SORT_9 = (SORT_9)1 << (64 - 1); [L35] const SORT_9 var_10 = 0; [L36] const SORT_1 var_18 = 1; [L37] const SORT_5 var_22 = 0; [L39] SORT_1 input_2; [L40] SORT_1 input_3; [L41] SORT_1 input_4; [L42] SORT_5 input_6; [L43] SORT_5 input_7; [L44] SORT_1 input_8; [L46] EXPR __VERIFIER_nondet_ulong() & 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] [L46] SORT_9 state_11 = __VERIFIER_nondet_ulong() & mask_SORT_9; [L47] EXPR __VERIFIER_nondet_ulong() & 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_13 = __VERIFIER_nondet_ulong() & mask_SORT_9; [L48] EXPR __VERIFIER_nondet_uint() & 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] [L48] SORT_5 state_23 = __VERIFIER_nondet_uint() & mask_SORT_5; [L49] EXPR __VERIFIER_nondet_uint() & 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_25 = __VERIFIER_nondet_uint() & mask_SORT_5; [L50] 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] [L50] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [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_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uint() & 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] [L52] SORT_5 state_31 = __VERIFIER_nondet_uint() & mask_SORT_5; [L53] EXPR __VERIFIER_nondet_uint() & 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_33 = __VERIFIER_nondet_uint() & mask_SORT_5; [L55] SORT_9 init_12_arg_1 = var_10; [L56] state_11 = init_12_arg_1 [L57] SORT_9 init_14_arg_1 = var_10; [L58] state_13 = init_14_arg_1 [L59] SORT_5 init_24_arg_1 = var_22; [L60] state_23 = init_24_arg_1 [L61] SORT_5 init_26_arg_1 = var_22; [L62] state_25 = init_26_arg_1 [L63] SORT_1 init_28_arg_1 = var_18; [L64] state_27 = init_28_arg_1 [L65] SORT_1 init_30_arg_1 = var_18; [L66] state_29 = init_30_arg_1 [L67] SORT_5 init_32_arg_1 = var_22; [L68] state_31 = init_32_arg_1 [L69] SORT_5 init_34_arg_1 = var_22; [L70] 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] [L73] input_2 = __VERIFIER_nondet_uchar() [L74] input_3 = __VERIFIER_nondet_uchar() [L75] 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] [L75] input_3 = input_3 & mask_SORT_1 [L76] input_4 = __VERIFIER_nondet_uchar() [L77] 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] [L77] input_4 = input_4 & mask_SORT_1 [L78] input_6 = __VERIFIER_nondet_uint() [L79] input_7 = __VERIFIER_nondet_uint() [L80] input_8 = __VERIFIER_nondet_uchar() [L81] 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] [L81] input_8 = input_8 & mask_SORT_1 [L84] SORT_9 var_15_arg_0 = state_11; [L85] SORT_9 var_15_arg_1 = state_13; [L86] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L87] SORT_1 var_19_arg_0 = var_15; [L88] SORT_1 var_19 = ~var_19_arg_0; [L89] SORT_1 var_20_arg_0 = var_18; [L90] 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] [L91] 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] [L91] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L92] 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] [L92] var_20 = var_20 & mask_SORT_1 [L93] SORT_1 bad_21_arg_0 = var_20; [L94] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 109 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 865 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 537 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 328 mSDtfsCounter, 199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 02:26:34,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0acb12ce5c1df780b96c69890f213c2ccd377bcb999df28d010d244cee6d0555 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:26:36,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:26:36,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 02:26:36,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:26:36,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:26:36,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:26:36,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:26:36,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:26:36,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:26:36,820 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:26:36,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:26:36,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:26:36,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:26:36,821 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:26:36,821 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:26:36,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:26:36,824 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:26:36,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:26:36,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:26:36,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:26:36,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:26:36,828 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 02:26:36,828 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 02:26:36,828 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:26:36,838 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 02:26:36,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:26:36,838 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:26:36,839 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:26:36,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:26:36,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:26:36,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:26:36,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:26:36,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:26:36,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:26:36,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:26:36,840 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 02:26:36,840 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 02:26:36,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:26:36,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:26:36,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:26:36,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:26:36,846 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0acb12ce5c1df780b96c69890f213c2ccd377bcb999df28d010d244cee6d0555 [2024-11-10 02:26:37,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:26:37,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:26:37,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:26:37,201 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:26:37,201 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:26:37,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul1.c [2024-11-10 02:26:38,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:26:39,029 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:26:39,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul1.c [2024-11-10 02:26:39,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b36d890/d96cc5e497884cf39d47198e9958069d/FLAG600225a39 [2024-11-10 02:26:39,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b36d890/d96cc5e497884cf39d47198e9958069d [2024-11-10 02:26:39,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:26:39,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:26:39,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:26:39,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:26:39,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:26:39,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:26:39" (1/1) ... [2024-11-10 02:26:39,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66159ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:39, skipping insertion in model container [2024-11-10 02:26:39,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:26:39" (1/1) ... [2024-11-10 02:26:39,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:26:39,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul1.c[1244,1257] [2024-11-10 02:26:39,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:26:39,734 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:26:39,748 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul1.c[1244,1257] [2024-11-10 02:26:39,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:26:39,815 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:26:39,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:39 WrapperNode [2024-11-10 02:26:39,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:26:39,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:26:39,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:26:39,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:26:39,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:39" (1/1) ... [2024-11-10 02:26:39,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:39" (1/1) ... [2024-11-10 02:26:39,876 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 204 [2024-11-10 02:26:39,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:26:39,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:26:39,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:26:39,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:26:39,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:39" (1/1) ... [2024-11-10 02:26:39,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:39" (1/1) ... [2024-11-10 02:26:39,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:39" (1/1) ... [2024-11-10 02:26:39,928 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-11-10 02:26:39,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:39" (1/1) ... [2024-11-10 02:26:39,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:39" (1/1) ... [2024-11-10 02:26:39,935 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:39" (1/1) ... [2024-11-10 02:26:39,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:39" (1/1) ... [2024-11-10 02:26:39,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:39" (1/1) ... [2024-11-10 02:26:39,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:39" (1/1) ... [2024-11-10 02:26:39,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:26:39,943 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:26:39,943 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:26:39,944 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:26:39,944 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:39" (1/1) ... [2024-11-10 02:26:39,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:26:39,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:26:39,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 02:26:39,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 02:26:40,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:26:40,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 02:26:40,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 02:26:40,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:26:40,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:26:40,119 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:26:40,121 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:26:40,464 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-10 02:26:40,465 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:26:40,483 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:26:40,483 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:26:40,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:26:40 BoogieIcfgContainer [2024-11-10 02:26:40,484 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:26:40,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:26:40,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:26:40,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:26:40,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:26:39" (1/3) ... [2024-11-10 02:26:40,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed72a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:26:40, skipping insertion in model container [2024-11-10 02:26:40,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:39" (2/3) ... [2024-11-10 02:26:40,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed72a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:26:40, skipping insertion in model container [2024-11-10 02:26:40,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:26:40" (3/3) ... [2024-11-10 02:26:40,495 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul1.c [2024-11-10 02:26:40,513 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:26:40,514 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:26:40,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:26:40,581 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;@27a0b34f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:26:40,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:26:40,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:40,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 02:26:40,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:40,597 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 02:26:40,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:40,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:40,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 02:26:40,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:26:40,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610965520] [2024-11-10 02:26:40,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:40,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:26:40,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:26:40,624 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 02:26:40,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 02:26:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:40,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 02:26:40,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:26:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:40,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 02:26:40,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:26:40,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610965520] [2024-11-10 02:26:40,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610965520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:40,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:40,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:26:40,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784262986] [2024-11-10 02:26:40,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:40,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:26:40,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:26:41,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:26:41,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:26:41,011 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:41,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:41,096 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-11-10 02:26:41,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:26:41,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-10 02:26:41,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:41,106 INFO L225 Difference]: With dead ends: 21 [2024-11-10 02:26:41,106 INFO L226 Difference]: Without dead ends: 10 [2024-11-10 02:26:41,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:26:41,114 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:41,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:26:41,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-10 02:26:41,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-10 02:26:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 02:26:41,144 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 02:26:41,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:41,145 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 02:26:41,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:41,145 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 02:26:41,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 02:26:41,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:41,145 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:26:41,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 02:26:41,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:26:41,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:41,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:41,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 02:26:41,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:26:41,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992533081] [2024-11-10 02:26:41,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:41,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:26:41,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:26:41,353 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 02:26:41,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 02:26:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:41,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 02:26:41,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:26:41,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:41,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:26:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:49,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:26:49,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992533081] [2024-11-10 02:26:49,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992533081] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:26:49,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 02:26:49,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 02:26:49,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819018518] [2024-11-10 02:26:49,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 02:26:49,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:26:49,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:26:49,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:26:49,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:26:49,122 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:50,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:50,495 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-11-10 02:26:50,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:26:50,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-10 02:26:50,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:50,496 INFO L225 Difference]: With dead ends: 16 [2024-11-10 02:26:50,496 INFO L226 Difference]: Without dead ends: 13 [2024-11-10 02:26:50,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 02:26:50,498 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:50,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 02:26:50,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-10 02:26:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-10 02:26:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-10 02:26:50,505 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2024-11-10 02:26:50,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:50,506 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-10 02:26:50,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:50,506 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-10 02:26:50,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 02:26:50,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:50,507 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-10 02:26:50,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 02:26:50,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:26:50,713 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:50,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1723041149, now seen corresponding path program 2 times [2024-11-10 02:26:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:26:50,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41037244] [2024-11-10 02:26:50,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 02:26:50,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:26:50,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:26:50,719 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 02:26:50,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 02:26:50,950 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 02:26:50,950 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 02:26:50,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-10 02:26:50,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:26:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:55,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:27:19,191 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 02:27:33,432 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 02:27:48,689 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 02:28:03,705 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse19 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_4~0#1|))))) (let ((.cse8 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_4~0#1|)) (.cse14 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse19))))))) (.cse2 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_16|))))))))) (.cse3 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_16|))))))))) (.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_29~0#1|))) (let ((.cse0 (forall ((|ULTIMATE.start_main_~state_27~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |ULTIMATE.start_main_~state_27~0#1|) .cse13))))) (_ bv0 8))))) (.cse7 (forall ((|ULTIMATE.start_main_~input_3~0#1| (_ BitVec 8))) (or (= (_ bv0 8) |ULTIMATE.start_main_~input_3~0#1|) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_3~0#1|))) .cse19)))))))))) (.cse4 (forall ((|ULTIMATE.start_main_~input_3~0#1| (_ BitVec 8))) (or (= (_ bv0 8) |ULTIMATE.start_main_~input_3~0#1|) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_3~0#1|))))))))))))) (.cse5 (or (forall ((|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~state_23~0#1_11| (_ BitVec 32))) (let ((.cse18 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_23~0#1_11| |ULTIMATE.start_main_~mask_SORT_5~0#1|)))) (= (bvand (bvmul .cse18 ((_ zero_extend 32) (bvand |c_ULTIMATE.start_main_~state_33~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|) (bvand (bvmul .cse18 ((_ zero_extend 32) (bvand |ULTIMATE.start_main_~mask_SORT_5~0#1| |c_ULTIMATE.start_main_~state_25~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|)))) (forall ((|ULTIMATE.start_main_~input_3~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_3~0#1|)))))))))))) (.cse1 (and .cse2 (or .cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 64))) (= (bvand (let ((.cse16 ((_ zero_extend 32) (bvand |ULTIMATE.start_main_~mask_SORT_5~0#1| |c_ULTIMATE.start_main_~var_22~0#1|)))) (bvmul .cse16 .cse16)) |ULTIMATE.start_main_~mask_SORT_9~0#1|) (bvand (bvand |c_ULTIMATE.start_main_~var_10~0#1| |ULTIMATE.start_main_~mask_SORT_9~0#1|) |ULTIMATE.start_main_~mask_SORT_9~0#1|))) (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_18~0#1|))))) (bvor .cse17 .cse17)))) .cse12)) (_ bv0 8)))))) (.cse10 (not .cse14)) (.cse9 (or .cse14 (forall ((|v_ULTIMATE.start_main_~state_25~0#1_11| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 64))) (let ((.cse15 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_11| |ULTIMATE.start_main_~mask_SORT_5~0#1|)))) (= (bvand (bvmul ((_ zero_extend 32) (bvand |ULTIMATE.start_main_~mask_SORT_5~0#1| |c_ULTIMATE.start_main_~state_31~0#1|)) .cse15) |ULTIMATE.start_main_~mask_SORT_9~0#1|) (bvand (bvmul .cse15 ((_ zero_extend 32) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|)))))) (.cse6 (not .cse8)) (.cse11 (forall ((|ULTIMATE.start_main_~state_27~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |ULTIMATE.start_main_~state_27~0#1|) .cse13))))) (_ bv0 8))))) (and (or .cse0 .cse1) (or (and (or (and .cse2 (or .cse3 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~state_23~0#1_11| (_ BitVec 32))) (= (bvand (bvand |c_ULTIMATE.start_main_~state_13~0#1| |ULTIMATE.start_main_~mask_SORT_9~0#1|) |ULTIMATE.start_main_~mask_SORT_9~0#1|) (bvand (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_23~0#1_11| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 32) (bvand |ULTIMATE.start_main_~mask_SORT_5~0#1| |c_ULTIMATE.start_main_~state_25~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|))) .cse4) .cse5))) .cse6) (or (and .cse2 (or .cse3 .cse7 (forall ((|v_ULTIMATE.start_main_~state_25~0#1_11| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~state_23~0#1_11| (_ BitVec 32))) (= (bvand (bvand |c_ULTIMATE.start_main_~state_13~0#1| |ULTIMATE.start_main_~mask_SORT_9~0#1|) |ULTIMATE.start_main_~mask_SORT_9~0#1|) (bvand (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_23~0#1_11| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_11| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|))))) .cse8)) .cse0) (or .cse0 (and (or (and .cse2 (or .cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 64))) (= (bvand (bvmul ((_ zero_extend 32) (bvand |ULTIMATE.start_main_~mask_SORT_5~0#1| |c_ULTIMATE.start_main_~state_25~0#1|)) ((_ zero_extend 32) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|) (bvand (bvand |c_ULTIMATE.start_main_~state_13~0#1| |ULTIMATE.start_main_~mask_SORT_9~0#1|) |ULTIMATE.start_main_~mask_SORT_9~0#1|))))) .cse6) (or (and .cse2 (or (and .cse9 (or .cse10 (forall ((|v_ULTIMATE.start_main_~state_25~0#1_11| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 64))) (= (bvand (bvand |c_ULTIMATE.start_main_~state_13~0#1| |ULTIMATE.start_main_~mask_SORT_9~0#1|) |ULTIMATE.start_main_~mask_SORT_9~0#1|) (bvand (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_11| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 32) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|))))) .cse3)) .cse8))) (or .cse11 (and (or (and .cse2 (or .cse3 (forall ((|v_ULTIMATE.start_main_~state_25~0#1_11| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~state_23~0#1_11| (_ BitVec 32))) (= (bvand (bvand (bvmul ((_ zero_extend 32) (bvand |ULTIMATE.start_main_~mask_SORT_5~0#1| |c_ULTIMATE.start_main_~state_31~0#1|)) ((_ zero_extend 32) (bvand |c_ULTIMATE.start_main_~state_33~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|) |ULTIMATE.start_main_~mask_SORT_9~0#1|) (bvand (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_23~0#1_11| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_11| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|))) .cse7)) .cse8) (or .cse6 (and .cse2 (or .cse3 (and (or .cse4 (forall ((|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~state_23~0#1_11| (_ BitVec 32))) (= (bvand (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_23~0#1_11| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 32) (bvand |ULTIMATE.start_main_~mask_SORT_5~0#1| |c_ULTIMATE.start_main_~state_25~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|) (bvand (bvand (bvmul ((_ zero_extend 32) (bvand |ULTIMATE.start_main_~mask_SORT_5~0#1| |c_ULTIMATE.start_main_~state_31~0#1|)) ((_ zero_extend 32) (bvand |c_ULTIMATE.start_main_~state_33~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|) |ULTIMATE.start_main_~mask_SORT_9~0#1|)))) .cse5)))))) (or .cse11 .cse1) (or (and (or (and .cse2 (or .cse3 (and (or (forall ((|v_ULTIMATE.start_main_~state_25~0#1_11| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 64))) (= (bvand (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_11| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 32) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|) (bvand (bvand (bvmul ((_ zero_extend 32) (bvand |ULTIMATE.start_main_~mask_SORT_5~0#1| |c_ULTIMATE.start_main_~state_31~0#1|)) ((_ zero_extend 32) (bvand |c_ULTIMATE.start_main_~state_33~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|) |ULTIMATE.start_main_~mask_SORT_9~0#1|))) .cse10) .cse9))) .cse8) (or (and .cse2 (or .cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 64))) (= (bvand (bvmul ((_ zero_extend 32) (bvand |ULTIMATE.start_main_~mask_SORT_5~0#1| |c_ULTIMATE.start_main_~state_25~0#1|)) ((_ zero_extend 32) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|) (bvand (bvand (bvmul ((_ zero_extend 32) (bvand |ULTIMATE.start_main_~mask_SORT_5~0#1| |c_ULTIMATE.start_main_~state_31~0#1|)) ((_ zero_extend 32) (bvand |c_ULTIMATE.start_main_~state_33~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|) |ULTIMATE.start_main_~mask_SORT_9~0#1|))))) .cse6)) .cse11))))) is different from true