./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.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 8d05a766c76ac0298c0a80f704d02f1cc9846c5882f0c27837b6bbd7c98f7d2d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 06:36:24,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 06:36:24,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 06:36:24,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 06:36:24,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 06:36:24,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 06:36:24,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 06:36:24,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 06:36:24,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 06:36:24,315 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 06:36:24,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 06:36:24,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 06:36:24,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 06:36:24,317 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 06:36:24,319 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 06:36:24,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 06:36:24,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 06:36:24,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 06:36:24,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 06:36:24,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 06:36:24,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 06:36:24,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 06:36:24,322 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 06:36:24,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 06:36:24,323 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 06:36:24,323 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 06:36:24,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 06:36:24,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 06:36:24,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 06:36:24,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:36:24,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 06:36:24,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 06:36:24,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 06:36:24,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 06:36:24,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 06:36:24,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 06:36:24,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 06:36:24,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 06:36:24,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 06:36:24,327 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 -> 8d05a766c76ac0298c0a80f704d02f1cc9846c5882f0c27837b6bbd7c98f7d2d [2024-10-14 06:36:24,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 06:36:24,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 06:36:24,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 06:36:24,618 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 06:36:24,619 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 06:36:24,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c [2024-10-14 06:36:26,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 06:36:26,299 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 06:36:26,300 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c [2024-10-14 06:36:26,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cff517f7/e9dd32939d5b47a6ab05efde9997de39/FLAG47794dfa7 [2024-10-14 06:36:26,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cff517f7/e9dd32939d5b47a6ab05efde9997de39 [2024-10-14 06:36:26,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 06:36:26,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 06:36:26,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 06:36:26,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 06:36:26,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 06:36:26,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:36:26" (1/1) ... [2024-10-14 06:36:26,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8284d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:26, skipping insertion in model container [2024-10-14 06:36:26,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:36:26" (1/1) ... [2024-10-14 06:36:26,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 06:36:26,546 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c[1244,1257] [2024-10-14 06:36:26,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:36:26,637 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 06:36:26,650 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c[1244,1257] [2024-10-14 06:36:26,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:36:26,715 INFO L204 MainTranslator]: Completed translation [2024-10-14 06:36:26,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:26 WrapperNode [2024-10-14 06:36:26,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 06:36:26,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 06:36:26,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 06:36:26,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 06:36:26,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:26" (1/1) ... [2024-10-14 06:36:26,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:26" (1/1) ... [2024-10-14 06:36:26,808 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 517 [2024-10-14 06:36:26,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 06:36:26,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 06:36:26,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 06:36:26,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 06:36:26,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:26" (1/1) ... [2024-10-14 06:36:26,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:26" (1/1) ... [2024-10-14 06:36:26,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:26" (1/1) ... [2024-10-14 06:36:26,873 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-14 06:36:26,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:26" (1/1) ... [2024-10-14 06:36:26,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:26" (1/1) ... [2024-10-14 06:36:26,896 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:26" (1/1) ... [2024-10-14 06:36:26,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:26" (1/1) ... [2024-10-14 06:36:26,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:26" (1/1) ... [2024-10-14 06:36:26,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:26" (1/1) ... [2024-10-14 06:36:26,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 06:36:26,944 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 06:36:26,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 06:36:26,945 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 06:36:26,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:26" (1/1) ... [2024-10-14 06:36:26,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:36:26,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:36:26,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 06:36:26,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 06:36:27,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 06:36:27,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 06:36:27,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 06:36:27,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 06:36:27,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 06:36:27,135 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 06:36:27,137 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 06:36:27,841 INFO L? ?]: Removed 210 outVars from TransFormulas that were not future-live. [2024-10-14 06:36:27,841 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 06:36:27,900 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 06:36:27,901 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 06:36:27,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:36:27 BoogieIcfgContainer [2024-10-14 06:36:27,901 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 06:36:27,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 06:36:27,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 06:36:27,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 06:36:27,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:36:26" (1/3) ... [2024-10-14 06:36:27,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a83393c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:36:27, skipping insertion in model container [2024-10-14 06:36:27,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:26" (2/3) ... [2024-10-14 06:36:27,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a83393c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:36:27, skipping insertion in model container [2024-10-14 06:36:27,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:36:27" (3/3) ... [2024-10-14 06:36:27,908 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul5.c [2024-10-14 06:36:27,922 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 06:36:27,922 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 06:36:27,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 06:36:27,987 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;@269ff92f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 06:36:27,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 06:36:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.503875968992248) internal successors, (194), 130 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 06:36:28,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:28,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:28,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:28,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:28,007 INFO L85 PathProgramCache]: Analyzing trace with hash -845314655, now seen corresponding path program 1 times [2024-10-14 06:36:28,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:28,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302605061] [2024-10-14 06:36:28,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:28,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:28,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:36:28,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302605061] [2024-10-14 06:36:28,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302605061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:28,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:28,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:36:28,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630347467] [2024-10-14 06:36:28,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:28,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:36:28,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:36:28,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:36:28,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:36:28,730 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.503875968992248) internal successors, (194), 130 states have internal predecessors, (194), 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 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:28,796 INFO L93 Difference]: Finished difference Result 222 states and 330 transitions. [2024-10-14 06:36:28,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:36:28,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 38 [2024-10-14 06:36:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:28,841 INFO L225 Difference]: With dead ends: 222 [2024-10-14 06:36:28,842 INFO L226 Difference]: Without dead ends: 132 [2024-10-14 06:36:28,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:36:28,848 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:28,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 562 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:36:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-14 06:36:28,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-14 06:36:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.4809160305343512) internal successors, (194), 131 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:28,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2024-10-14 06:36:28,897 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 38 [2024-10-14 06:36:28,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:28,900 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2024-10-14 06:36:28,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:28,900 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2024-10-14 06:36:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 06:36:28,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:28,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:28,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 06:36:28,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:28,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:28,904 INFO L85 PathProgramCache]: Analyzing trace with hash -433255155, now seen corresponding path program 1 times [2024-10-14 06:36:28,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:28,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420197169] [2024-10-14 06:36:28,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:28,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:29,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:36:29,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420197169] [2024-10-14 06:36:29,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420197169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:29,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:29,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:36:29,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167892452] [2024-10-14 06:36:29,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:29,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:36:29,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:36:29,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:36:29,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:36:29,085 INFO L87 Difference]: Start difference. First operand 132 states and 194 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:29,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:29,147 INFO L93 Difference]: Finished difference Result 225 states and 330 transitions. [2024-10-14 06:36:29,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:36:29,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2024-10-14 06:36:29,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:29,149 INFO L225 Difference]: With dead ends: 225 [2024-10-14 06:36:29,149 INFO L226 Difference]: Without dead ends: 134 [2024-10-14 06:36:29,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:36:29,151 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:29,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 559 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:36:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-14 06:36:29,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-14 06:36:29,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.4736842105263157) internal successors, (196), 133 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 196 transitions. [2024-10-14 06:36:29,160 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 196 transitions. Word has length 39 [2024-10-14 06:36:29,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:29,160 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 196 transitions. [2024-10-14 06:36:29,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 196 transitions. [2024-10-14 06:36:29,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 06:36:29,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:29,162 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:29,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 06:36:29,163 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:29,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:29,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1643973638, now seen corresponding path program 1 times [2024-10-14 06:36:29,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:29,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518896768] [2024-10-14 06:36:29,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:29,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:29,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:36:29,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518896768] [2024-10-14 06:36:29,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518896768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:29,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:29,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:36:29,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065499166] [2024-10-14 06:36:29,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:29,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:36:29,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:36:29,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:36:29,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:36:29,577 INFO L87 Difference]: Start difference. First operand 134 states and 196 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:29,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:29,648 INFO L93 Difference]: Finished difference Result 264 states and 382 transitions. [2024-10-14 06:36:29,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:36:29,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2024-10-14 06:36:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:29,651 INFO L225 Difference]: With dead ends: 264 [2024-10-14 06:36:29,653 INFO L226 Difference]: Without dead ends: 171 [2024-10-14 06:36:29,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:36:29,655 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 79 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:29,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 678 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:36:29,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-14 06:36:29,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 152. [2024-10-14 06:36:29,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.4701986754966887) internal successors, (222), 151 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:29,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 222 transitions. [2024-10-14 06:36:29,677 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 222 transitions. Word has length 40 [2024-10-14 06:36:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:29,678 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 222 transitions. [2024-10-14 06:36:29,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 222 transitions. [2024-10-14 06:36:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 06:36:29,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:29,679 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:29,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 06:36:29,680 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:29,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:29,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1485311796, now seen corresponding path program 1 times [2024-10-14 06:36:29,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:29,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909620686] [2024-10-14 06:36:29,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:30,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:36:30,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909620686] [2024-10-14 06:36:30,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909620686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:30,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:30,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 06:36:30,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673593672] [2024-10-14 06:36:30,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:30,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 06:36:30,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:36:30,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 06:36:30,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:36:30,047 INFO L87 Difference]: Start difference. First operand 152 states and 222 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:30,148 INFO L93 Difference]: Finished difference Result 266 states and 384 transitions. [2024-10-14 06:36:30,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 06:36:30,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-10-14 06:36:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:30,150 INFO L225 Difference]: With dead ends: 266 [2024-10-14 06:36:30,151 INFO L226 Difference]: Without dead ends: 173 [2024-10-14 06:36:30,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-14 06:36:30,153 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 80 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:30,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1035 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:36:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-14 06:36:30,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 155. [2024-10-14 06:36:30,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.4675324675324675) internal successors, (226), 154 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 226 transitions. [2024-10-14 06:36:30,168 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 226 transitions. Word has length 41 [2024-10-14 06:36:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:30,169 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 226 transitions. [2024-10-14 06:36:30,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 226 transitions. [2024-10-14 06:36:30,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 06:36:30,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:30,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:30,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 06:36:30,170 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:30,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:30,172 INFO L85 PathProgramCache]: Analyzing trace with hash -880628073, now seen corresponding path program 1 times [2024-10-14 06:36:30,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:30,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348164562] [2024-10-14 06:36:30,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:30,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:30,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:36:30,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348164562] [2024-10-14 06:36:30,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348164562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:30,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:30,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 06:36:30,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692389317] [2024-10-14 06:36:30,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:30,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 06:36:30,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:36:30,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 06:36:30,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:36:30,700 INFO L87 Difference]: Start difference. First operand 155 states and 226 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:30,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:30,828 INFO L93 Difference]: Finished difference Result 266 states and 383 transitions. [2024-10-14 06:36:30,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 06:36:30,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-14 06:36:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:30,830 INFO L225 Difference]: With dead ends: 266 [2024-10-14 06:36:30,830 INFO L226 Difference]: Without dead ends: 173 [2024-10-14 06:36:30,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-14 06:36:30,834 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 77 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:30,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1015 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:36:30,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-14 06:36:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 159. [2024-10-14 06:36:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.4620253164556962) internal successors, (231), 158 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 231 transitions. [2024-10-14 06:36:30,849 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 231 transitions. Word has length 42 [2024-10-14 06:36:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:30,849 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 231 transitions. [2024-10-14 06:36:30,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 231 transitions. [2024-10-14 06:36:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 06:36:30,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:30,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:30,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 06:36:30,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:30,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:30,854 INFO L85 PathProgramCache]: Analyzing trace with hash 34878835, now seen corresponding path program 1 times [2024-10-14 06:36:30,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:30,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839022377] [2024-10-14 06:36:30,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:30,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:36:30,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 06:36:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:36:30,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 06:36:30,951 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 06:36:30,952 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 06:36:30,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 06:36:30,957 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 06:36:31,010 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 06:36:31,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:36:31 BoogieIcfgContainer [2024-10-14 06:36:31,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 06:36:31,018 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 06:36:31,018 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 06:36:31,018 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 06:36:31,019 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:36:27" (3/4) ... [2024-10-14 06:36:31,021 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 06:36:31,023 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 06:36:31,024 INFO L158 Benchmark]: Toolchain (without parser) took 4693.75ms. Allocated memory was 167.8MB in the beginning and 230.7MB in the end (delta: 62.9MB). Free memory was 136.3MB in the beginning and 131.7MB in the end (delta: 4.6MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-10-14 06:36:31,024 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:36:31,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.05ms. Allocated memory is still 167.8MB. Free memory was 136.3MB in the beginning and 118.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 06:36:31,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.77ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 111.1MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 06:36:31,025 INFO L158 Benchmark]: Boogie Preprocessor took 134.48ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 105.5MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 06:36:31,027 INFO L158 Benchmark]: RCFGBuilder took 957.03ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 133.2MB in the end (delta: -27.7MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2024-10-14 06:36:31,028 INFO L158 Benchmark]: TraceAbstraction took 3114.13ms. Allocated memory was 167.8MB in the beginning and 230.7MB in the end (delta: 62.9MB). Free memory was 132.1MB in the beginning and 132.8MB in the end (delta: -605.2kB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. [2024-10-14 06:36:31,028 INFO L158 Benchmark]: Witness Printer took 4.83ms. Allocated memory is still 230.7MB. Free memory was 132.8MB in the beginning and 131.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 06:36:31,029 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.14ms. Allocated memory is still 167.8MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.05ms. Allocated memory is still 167.8MB. Free memory was 136.3MB in the beginning and 118.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.77ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 111.1MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.48ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 105.5MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 957.03ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 133.2MB in the end (delta: -27.7MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3114.13ms. Allocated memory was 167.8MB in the beginning and 230.7MB in the end (delta: 62.9MB). Free memory was 132.1MB in the beginning and 132.8MB in the end (delta: -605.2kB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. * Witness Printer took 4.83ms. Allocated memory is still 230.7MB. Free memory was 132.8MB in the beginning and 131.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 bitwiseOr at line 107, overapproximation of bitwiseAnd at line 112. 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_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 10); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (10 - 1); [L35] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 64); [L36] const SORT_14 msb_SORT_14 = (SORT_14)1 << (64 - 1); [L38] const SORT_1 var_10 = 0; [L39] const SORT_14 var_15 = 0; [L40] const SORT_1 var_24 = 1; [L41] const SORT_5 var_28 = 0; [L42] const SORT_8 var_35 = 0; [L43] const SORT_5 var_57 = 1; [L44] const SORT_5 var_61 = 1000; [L45] const SORT_5 var_63 = 3735928559; [L46] const SORT_5 var_66 = 12245771; [L48] SORT_1 input_2; [L49] SORT_1 input_3; [L50] SORT_1 input_4; [L51] SORT_5 input_6; [L52] SORT_5 input_7; [L53] SORT_8 input_9; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L55] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L56] SORT_14 state_16 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L57] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L57] SORT_14 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L58] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L58] SORT_5 state_29 = __VERIFIER_nondet_uint() & mask_SORT_5; [L59] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L59] SORT_5 state_31 = __VERIFIER_nondet_uint() & mask_SORT_5; [L60] EXPR __VERIFIER_nondet_ushort() & mask_SORT_8 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L60] SORT_8 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_8; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L61] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L62] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L63] SORT_5 state_42 = __VERIFIER_nondet_uint() & mask_SORT_5; [L64] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L64] SORT_5 state_44 = __VERIFIER_nondet_uint() & mask_SORT_5; [L66] SORT_1 init_12_arg_1 = var_10; [L67] state_11 = init_12_arg_1 [L68] SORT_14 init_17_arg_1 = var_15; [L69] state_16 = init_17_arg_1 [L70] SORT_14 init_19_arg_1 = var_15; [L71] state_18 = init_19_arg_1 [L72] SORT_5 init_30_arg_1 = var_28; [L73] state_29 = init_30_arg_1 [L74] SORT_5 init_32_arg_1 = var_28; [L75] state_31 = init_32_arg_1 [L76] SORT_8 init_37_arg_1 = var_35; [L77] state_36 = init_37_arg_1 [L78] SORT_1 init_39_arg_1 = var_24; [L79] state_38 = init_39_arg_1 [L80] SORT_1 init_41_arg_1 = var_24; [L81] state_40 = init_41_arg_1 [L82] SORT_5 init_43_arg_1 = var_28; [L83] state_42 = init_43_arg_1 [L84] SORT_5 init_45_arg_1 = var_28; [L85] state_44 = init_45_arg_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L88] input_2 = __VERIFIER_nondet_uchar() [L89] input_3 = __VERIFIER_nondet_uchar() [L90] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L90] input_3 = input_3 & mask_SORT_1 [L91] input_4 = __VERIFIER_nondet_uchar() [L92] EXPR input_4 & mask_SORT_1 VAL [input_3=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L92] input_4 = input_4 & mask_SORT_1 [L93] input_6 = __VERIFIER_nondet_uint() [L94] EXPR input_6 & mask_SORT_5 VAL [input_3=0, input_4=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L94] input_6 = input_6 & mask_SORT_5 [L95] input_7 = __VERIFIER_nondet_uint() [L96] EXPR input_7 & mask_SORT_5 VAL [input_3=0, input_4=0, input_6=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L96] input_7 = input_7 & mask_SORT_5 [L97] input_9 = __VERIFIER_nondet_ushort() [L100] SORT_1 var_13_arg_0 = state_11; [L101] SORT_1 var_13 = ~var_13_arg_0; [L102] SORT_14 var_20_arg_0 = state_16; [L103] SORT_14 var_20_arg_1 = state_18; [L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L105] SORT_1 var_21_arg_0 = var_13; [L106] SORT_1 var_21_arg_1 = var_20; VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_21_arg_0=-1, var_21_arg_1=1, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L107] EXPR var_21_arg_0 | var_21_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L108] SORT_1 var_25_arg_0 = var_21; [L109] SORT_1 var_25 = ~var_25_arg_0; [L110] SORT_1 var_26_arg_0 = var_24; [L111] SORT_1 var_26_arg_1 = var_25; VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_26_arg_0=1, var_26_arg_1=-1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L112] EXPR var_26_arg_0 & var_26_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L113] EXPR var_26 & mask_SORT_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L113] var_26 = var_26 & mask_SORT_1 [L114] SORT_1 bad_27_arg_0 = var_26; [L115] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 3849 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2925 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 190 IncrementalHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 924 mSDtfsCounter, 190 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 661 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 06:36:31,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.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 8d05a766c76ac0298c0a80f704d02f1cc9846c5882f0c27837b6bbd7c98f7d2d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 06:36:33,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 06:36:33,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 06:36:33,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 06:36:33,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 06:36:33,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 06:36:33,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 06:36:33,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 06:36:33,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 06:36:33,418 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 06:36:33,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 06:36:33,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 06:36:33,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 06:36:33,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 06:36:33,421 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 06:36:33,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 06:36:33,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 06:36:33,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 06:36:33,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 06:36:33,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 06:36:33,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 06:36:33,427 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 06:36:33,427 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 06:36:33,428 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 06:36:33,428 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 06:36:33,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 06:36:33,428 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 06:36:33,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 06:36:33,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 06:36:33,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 06:36:33,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 06:36:33,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:36:33,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 06:36:33,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 06:36:33,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 06:36:33,432 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 06:36:33,432 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 06:36:33,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 06:36:33,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 06:36:33,433 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 06:36:33,433 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 06:36:33,434 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 06:36:33,434 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 -> 8d05a766c76ac0298c0a80f704d02f1cc9846c5882f0c27837b6bbd7c98f7d2d [2024-10-14 06:36:33,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 06:36:33,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 06:36:33,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 06:36:33,806 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 06:36:33,807 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 06:36:33,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c [2024-10-14 06:36:35,483 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 06:36:35,732 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 06:36:35,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c [2024-10-14 06:36:35,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/490ff0d4c/88100c3ec5ea4230bf0a0ac771742219/FLAGea8999761 [2024-10-14 06:36:35,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/490ff0d4c/88100c3ec5ea4230bf0a0ac771742219 [2024-10-14 06:36:35,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 06:36:35,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 06:36:35,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 06:36:35,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 06:36:35,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 06:36:35,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:36:35" (1/1) ... [2024-10-14 06:36:35,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20c9f85e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:35, skipping insertion in model container [2024-10-14 06:36:35,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:36:35" (1/1) ... [2024-10-14 06:36:35,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 06:36:35,998 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c[1244,1257] [2024-10-14 06:36:36,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:36:36,112 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 06:36:36,125 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c[1244,1257] [2024-10-14 06:36:36,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:36:36,207 INFO L204 MainTranslator]: Completed translation [2024-10-14 06:36:36,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:36 WrapperNode [2024-10-14 06:36:36,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 06:36:36,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 06:36:36,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 06:36:36,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 06:36:36,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:36" (1/1) ... [2024-10-14 06:36:36,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:36" (1/1) ... [2024-10-14 06:36:36,262 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 269 [2024-10-14 06:36:36,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 06:36:36,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 06:36:36,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 06:36:36,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 06:36:36,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:36" (1/1) ... [2024-10-14 06:36:36,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:36" (1/1) ... [2024-10-14 06:36:36,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:36" (1/1) ... [2024-10-14 06:36:36,305 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-14 06:36:36,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:36" (1/1) ... [2024-10-14 06:36:36,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:36" (1/1) ... [2024-10-14 06:36:36,315 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:36" (1/1) ... [2024-10-14 06:36:36,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:36" (1/1) ... [2024-10-14 06:36:36,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:36" (1/1) ... [2024-10-14 06:36:36,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:36" (1/1) ... [2024-10-14 06:36:36,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 06:36:36,339 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 06:36:36,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 06:36:36,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 06:36:36,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:36" (1/1) ... [2024-10-14 06:36:36,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:36:36,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:36:36,377 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 06:36:36,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 06:36:36,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 06:36:36,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 06:36:36,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 06:36:36,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 06:36:36,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 06:36:36,571 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 06:36:36,576 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 06:36:37,015 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-10-14 06:36:37,018 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 06:36:37,056 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 06:36:37,058 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 06:36:37,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:36:37 BoogieIcfgContainer [2024-10-14 06:36:37,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 06:36:37,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 06:36:37,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 06:36:37,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 06:36:37,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:36:35" (1/3) ... [2024-10-14 06:36:37,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff52443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:36:37, skipping insertion in model container [2024-10-14 06:36:37,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:36" (2/3) ... [2024-10-14 06:36:37,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff52443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:36:37, skipping insertion in model container [2024-10-14 06:36:37,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:36:37" (3/3) ... [2024-10-14 06:36:37,068 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul5.c [2024-10-14 06:36:37,103 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 06:36:37,103 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 06:36:37,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 06:36:37,170 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;@3b128162, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 06:36:37,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 06:36:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 06:36:37,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:37,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 06:36:37,183 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:37,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:37,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 06:36:37,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:36:37,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856975101] [2024-10-14 06:36:37,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:37,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:36:37,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:36:37,207 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 06:36:37,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 06:36:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:37,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 06:36:37,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:36:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:37,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 06:36:37,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:36:37,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856975101] [2024-10-14 06:36:37,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856975101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:37,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:37,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 06:36:37,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959588193] [2024-10-14 06:36:37,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:37,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:36:37,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:36:37,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:36:37,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:36:37,549 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:37,724 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-14 06:36:37,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:36:37,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 06:36:37,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:37,734 INFO L225 Difference]: With dead ends: 15 [2024-10-14 06:36:37,735 INFO L226 Difference]: Without dead ends: 9 [2024-10-14 06:36:37,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:36:37,741 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:37,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:36:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-14 06:36:37,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-14 06:36:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 06:36:37,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 06:36:37,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:37,770 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 06:36:37,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:37,771 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 06:36:37,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 06:36:37,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:37,771 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 06:36:37,775 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 (2)] Ended with exit code 0 [2024-10-14 06:36:37,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:36:37,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:37,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:37,976 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 06:36:37,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:36:37,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270927303] [2024-10-14 06:36:37,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:37,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:36:37,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:36:37,979 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 06:36:37,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 06:36:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:38,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 06:36:38,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:36:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:38,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:36:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:44,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:36:44,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270927303] [2024-10-14 06:36:44,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270927303] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:36:44,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 06:36:44,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 06:36:44,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041832636] [2024-10-14 06:36:44,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 06:36:44,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 06:36:44,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:36:44,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 06:36:44,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 06:36:44,397 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:44,733 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-14 06:36:44,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 06:36:44,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 06:36:44,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:44,734 INFO L225 Difference]: With dead ends: 13 [2024-10-14 06:36:44,734 INFO L226 Difference]: Without dead ends: 11 [2024-10-14 06:36:44,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 06:36:44,735 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:44,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 06:36:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-14 06:36:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-14 06:36:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-14 06:36:44,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-14 06:36:44,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:44,740 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-14 06:36:44,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-14 06:36:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 06:36:44,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:44,743 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-14 06:36:44,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 06:36:44,943 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-10-14 06:36:44,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:44,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:44,945 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-14 06:36:44,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:36:44,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41989337] [2024-10-14 06:36:44,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 06:36:44,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:36:44,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:36:44,950 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-10-14 06:36:44,951 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-10-14 06:36:45,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 06:36:45,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-14 06:36:45,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 06:36:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:36:45,642 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-14 06:36:45,642 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 06:36:45,643 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 06:36:45,657 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 (4)] Ended with exit code 0 [2024-10-14 06:36:45,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:36:45,849 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-10-14 06:36:45,947 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 06:36:45,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:36:45 BoogieIcfgContainer [2024-10-14 06:36:45,950 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 06:36:45,951 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 06:36:45,951 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 06:36:45,951 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 06:36:45,953 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:36:37" (3/4) ... [2024-10-14 06:36:45,954 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 06:36:46,054 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 06:36:46,054 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 06:36:46,055 INFO L158 Benchmark]: Toolchain (without parser) took 10283.79ms. Allocated memory was 60.8MB in the beginning and 283.1MB in the end (delta: 222.3MB). Free memory was 34.2MB in the beginning and 247.2MB in the end (delta: -213.0MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-10-14 06:36:46,055 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 44.0MB. Free memory was 20.7MB in the beginning and 20.7MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:36:46,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.99ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 34.1MB in the beginning and 49.5MB in the end (delta: -15.4MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-10-14 06:36:46,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.35ms. Allocated memory is still 77.6MB. Free memory was 49.5MB in the beginning and 46.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 06:36:46,057 INFO L158 Benchmark]: Boogie Preprocessor took 72.43ms. Allocated memory is still 77.6MB. Free memory was 46.9MB in the beginning and 43.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 06:36:46,057 INFO L158 Benchmark]: RCFGBuilder took 720.42ms. Allocated memory is still 77.6MB. Free memory was 43.5MB in the beginning and 32.6MB in the end (delta: 10.9MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-10-14 06:36:46,057 INFO L158 Benchmark]: TraceAbstraction took 8888.93ms. Allocated memory was 77.6MB in the beginning and 283.1MB in the end (delta: 205.5MB). Free memory was 31.9MB in the beginning and 254.5MB in the end (delta: -222.6MB). Peak memory consumption was 113.9MB. Max. memory is 16.1GB. [2024-10-14 06:36:46,058 INFO L158 Benchmark]: Witness Printer took 103.65ms. Allocated memory is still 283.1MB. Free memory was 254.5MB in the beginning and 247.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 06:36:46,059 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.17ms. Allocated memory is still 44.0MB. Free memory was 20.7MB in the beginning and 20.7MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.99ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 34.1MB in the beginning and 49.5MB in the end (delta: -15.4MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.35ms. Allocated memory is still 77.6MB. Free memory was 49.5MB in the beginning and 46.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.43ms. Allocated memory is still 77.6MB. Free memory was 46.9MB in the beginning and 43.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 720.42ms. Allocated memory is still 77.6MB. Free memory was 43.5MB in the beginning and 32.6MB in the end (delta: 10.9MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8888.93ms. Allocated memory was 77.6MB in the beginning and 283.1MB in the end (delta: 205.5MB). Free memory was 31.9MB in the beginning and 254.5MB in the end (delta: -222.6MB). Peak memory consumption was 113.9MB. Max. memory is 16.1GB. * Witness Printer took 103.65ms. Allocated memory is still 283.1MB. Free memory was 254.5MB in the beginning and 247.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a 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_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 10); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (10 - 1); [L35] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 64); [L36] const SORT_14 msb_SORT_14 = (SORT_14)1 << (64 - 1); [L38] const SORT_1 var_10 = 0; [L39] const SORT_14 var_15 = 0; [L40] const SORT_1 var_24 = 1; [L41] const SORT_5 var_28 = 0; [L42] const SORT_8 var_35 = 0; [L43] const SORT_5 var_57 = 1; [L44] const SORT_5 var_61 = 1000; [L45] const SORT_5 var_63 = 3735928559; [L46] const SORT_5 var_66 = 12245771; [L48] SORT_1 input_2; [L49] SORT_1 input_3; [L50] SORT_1 input_4; [L51] SORT_5 input_6; [L52] SORT_5 input_7; [L53] SORT_8 input_9; [L55] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] SORT_14 state_16 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L57] SORT_14 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L58] SORT_5 state_29 = __VERIFIER_nondet_uint() & mask_SORT_5; [L59] SORT_5 state_31 = __VERIFIER_nondet_uint() & mask_SORT_5; [L60] SORT_8 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_8; [L61] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] SORT_5 state_42 = __VERIFIER_nondet_uint() & mask_SORT_5; [L64] SORT_5 state_44 = __VERIFIER_nondet_uint() & mask_SORT_5; [L66] SORT_1 init_12_arg_1 = var_10; [L67] state_11 = init_12_arg_1 [L68] SORT_14 init_17_arg_1 = var_15; [L69] state_16 = init_17_arg_1 [L70] SORT_14 init_19_arg_1 = var_15; [L71] state_18 = init_19_arg_1 [L72] SORT_5 init_30_arg_1 = var_28; [L73] state_29 = init_30_arg_1 [L74] SORT_5 init_32_arg_1 = var_28; [L75] state_31 = init_32_arg_1 [L76] SORT_8 init_37_arg_1 = var_35; [L77] state_36 = init_37_arg_1 [L78] SORT_1 init_39_arg_1 = var_24; [L79] state_38 = init_39_arg_1 [L80] SORT_1 init_41_arg_1 = var_24; [L81] state_40 = init_41_arg_1 [L82] SORT_5 init_43_arg_1 = var_28; [L83] state_42 = init_43_arg_1 [L84] SORT_5 init_45_arg_1 = var_28; [L85] state_44 = init_45_arg_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=-559038737, var_66=12245771] [L88] input_2 = __VERIFIER_nondet_uchar() [L89] input_3 = __VERIFIER_nondet_uchar() [L90] input_3 = input_3 & mask_SORT_1 [L91] input_4 = __VERIFIER_nondet_uchar() [L92] input_4 = input_4 & mask_SORT_1 [L93] input_6 = __VERIFIER_nondet_uint() [L94] input_6 = input_6 & mask_SORT_5 [L95] input_7 = __VERIFIER_nondet_uint() [L96] input_7 = input_7 & mask_SORT_5 [L97] input_9 = __VERIFIER_nondet_ushort() [L100] SORT_1 var_13_arg_0 = state_11; [L101] SORT_1 var_13 = ~var_13_arg_0; [L102] SORT_14 var_20_arg_0 = state_16; [L103] SORT_14 var_20_arg_1 = state_18; [L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L105] SORT_1 var_21_arg_0 = var_13; [L106] SORT_1 var_21_arg_1 = var_20; [L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L108] SORT_1 var_25_arg_0 = var_21; [L109] SORT_1 var_25 = ~var_25_arg_0; [L110] SORT_1 var_26_arg_0 = var_24; [L111] SORT_1 var_26_arg_1 = var_25; [L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L113] var_26 = var_26 & mask_SORT_1 [L114] SORT_1 bad_27_arg_0 = var_26; [L115] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND FALSE !(!(cond)) [L115] RET __VERIFIER_assert(!(bad_27_arg_0)) [L117] SORT_1 next_51_arg_1 = var_24; [L118] SORT_1 var_33_arg_0 = state_11; [L119] SORT_1 var_33 = ~var_33_arg_0; [L120] var_33 = var_33 & mask_SORT_1 [L121] SORT_5 var_52_arg_0 = state_29; [L122] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L123] SORT_14 var_52 = var_52_arg_0; [L124] SORT_5 var_53_arg_0 = state_31; [L125] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L126] SORT_14 var_53 = var_53_arg_0; [L127] SORT_14 var_54_arg_0 = var_52; [L128] SORT_14 var_54_arg_1 = var_53; [L129] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L130] SORT_1 var_55_arg_0 = var_33; [L131] SORT_14 var_55_arg_1 = var_15; [L132] SORT_14 var_55_arg_2 = var_54; [L133] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L134] var_55 = var_55 & mask_SORT_14 [L135] SORT_14 next_56_arg_1 = var_55; [L136] SORT_1 var_70_arg_0 = state_38; [L137] SORT_1 var_70_arg_1 = state_40; [L138] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L139] var_70 = var_70 & mask_SORT_1 [L140] SORT_8 var_60_arg_0 = state_36; [L141] var_60_arg_0 = var_60_arg_0 & mask_SORT_8 [L142] SORT_5 var_60 = var_60_arg_0; [L143] SORT_5 var_62_arg_0 = var_60; [L144] SORT_5 var_62_arg_1 = var_61; [L145] SORT_1 var_62 = var_62_arg_0 > var_62_arg_1; [L146] SORT_5 var_64_arg_0 = input_6; [L147] SORT_5 var_64_arg_1 = var_63; [L148] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1; [L149] SORT_1 var_65_arg_0 = var_62; [L150] SORT_1 var_65_arg_1 = var_64; [L151] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1; [L152] SORT_5 var_67_arg_0 = input_7; [L153] SORT_5 var_67_arg_1 = var_66; [L154] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L155] SORT_1 var_68_arg_0 = var_65; [L156] SORT_1 var_68_arg_1 = var_67; [L157] SORT_1 var_68 = var_68_arg_0 & var_68_arg_1; [L158] var_68 = var_68 & mask_SORT_1 [L159] SORT_5 var_46_arg_0 = state_42; [L160] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L161] SORT_14 var_46 = var_46_arg_0; [L162] SORT_5 var_47_arg_0 = state_44; [L163] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L164] SORT_14 var_47 = var_47_arg_0; [L165] SORT_14 var_48_arg_0 = var_46; [L166] SORT_14 var_48_arg_1 = var_47; [L167] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L168] SORT_5 var_58_arg_0 = var_57; [L169] var_58_arg_0 = var_58_arg_0 & mask_SORT_5 [L170] SORT_14 var_58 = var_58_arg_0; [L171] SORT_14 var_59_arg_0 = var_48; [L172] SORT_14 var_59_arg_1 = var_58; [L173] SORT_14 var_59 = var_59_arg_0 + var_59_arg_1; [L174] SORT_1 var_69_arg_0 = var_68; [L175] SORT_14 var_69_arg_1 = var_59; [L176] SORT_14 var_69_arg_2 = var_48; [L177] SORT_14 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L178] SORT_1 var_71_arg_0 = var_70; [L179] SORT_14 var_71_arg_1 = var_69; [L180] SORT_14 var_71_arg_2 = state_18; [L181] SORT_14 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L182] SORT_1 var_72_arg_0 = var_33; [L183] SORT_14 var_72_arg_1 = var_15; [L184] SORT_14 var_72_arg_2 = var_71; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] var_72 = var_72 & mask_SORT_14 [L187] SORT_14 next_73_arg_1 = var_72; [L188] SORT_1 var_74_arg_0 = input_3; [L189] SORT_5 var_74_arg_1 = input_6; [L190] SORT_5 var_74_arg_2 = state_29; [L191] SORT_5 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2; [L192] SORT_1 var_75_arg_0 = var_33; [L193] SORT_5 var_75_arg_1 = var_28; [L194] SORT_5 var_75_arg_2 = var_74; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_5 next_76_arg_1 = var_75; [L197] SORT_1 var_77_arg_0 = input_4; [L198] SORT_5 var_77_arg_1 = input_7; [L199] SORT_5 var_77_arg_2 = state_31; [L200] SORT_5 var_77 = var_77_arg_0 ? var_77_arg_1 : var_77_arg_2; [L201] SORT_1 var_78_arg_0 = var_33; [L202] SORT_5 var_78_arg_1 = var_28; [L203] SORT_5 var_78_arg_2 = var_77; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_5 next_79_arg_1 = var_78; [L206] SORT_1 var_80_arg_0 = var_33; [L207] SORT_8 var_80_arg_1 = input_9; [L208] SORT_8 var_80_arg_2 = state_36; [L209] SORT_8 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2; [L210] SORT_8 next_81_arg_1 = var_80; [L211] SORT_1 var_82_arg_0 = var_33; [L212] SORT_1 var_82_arg_1 = var_24; [L213] SORT_1 var_82_arg_2 = input_3; [L214] SORT_1 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2; [L215] SORT_1 next_83_arg_1 = var_82; [L216] SORT_1 var_84_arg_0 = var_33; [L217] SORT_1 var_84_arg_1 = var_24; [L218] SORT_1 var_84_arg_2 = input_4; [L219] SORT_1 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2; [L220] SORT_1 next_85_arg_1 = var_84; [L221] SORT_1 var_86_arg_0 = input_3; [L222] SORT_5 var_86_arg_1 = input_6; [L223] SORT_5 var_86_arg_2 = state_42; [L224] SORT_5 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; [L225] SORT_1 var_87_arg_0 = var_33; [L226] SORT_5 var_87_arg_1 = var_28; [L227] SORT_5 var_87_arg_2 = var_86; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_5 next_88_arg_1 = var_87; [L230] SORT_1 var_89_arg_0 = input_4; [L231] SORT_5 var_89_arg_1 = input_7; [L232] SORT_5 var_89_arg_2 = state_44; [L233] SORT_5 var_89 = var_89_arg_0 ? var_89_arg_1 : var_89_arg_2; [L234] SORT_1 var_90_arg_0 = var_33; [L235] SORT_5 var_90_arg_1 = var_28; [L236] SORT_5 var_90_arg_2 = var_89; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_5 next_91_arg_1 = var_90; [L240] state_11 = next_51_arg_1 [L241] state_16 = next_56_arg_1 [L242] state_18 = next_73_arg_1 [L243] state_29 = next_76_arg_1 [L244] state_31 = next_79_arg_1 [L245] state_36 = next_81_arg_1 [L246] state_38 = next_83_arg_1 [L247] state_40 = next_85_arg_1 [L248] state_42 = next_88_arg_1 [L249] state_44 = next_91_arg_1 [L88] input_2 = __VERIFIER_nondet_uchar() [L89] input_3 = __VERIFIER_nondet_uchar() [L90] input_3 = input_3 & mask_SORT_1 [L91] input_4 = __VERIFIER_nondet_uchar() [L92] input_4 = input_4 & mask_SORT_1 [L93] input_6 = __VERIFIER_nondet_uint() [L94] input_6 = input_6 & mask_SORT_5 [L95] input_7 = __VERIFIER_nondet_uint() [L96] input_7 = input_7 & mask_SORT_5 [L97] input_9 = __VERIFIER_nondet_ushort() [L100] SORT_1 var_13_arg_0 = state_11; [L101] SORT_1 var_13 = ~var_13_arg_0; [L102] SORT_14 var_20_arg_0 = state_16; [L103] SORT_14 var_20_arg_1 = state_18; [L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L105] SORT_1 var_21_arg_0 = var_13; [L106] SORT_1 var_21_arg_1 = var_20; [L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L108] SORT_1 var_25_arg_0 = var_21; [L109] SORT_1 var_25 = ~var_25_arg_0; [L110] SORT_1 var_26_arg_0 = var_24; [L111] SORT_1 var_26_arg_1 = var_25; [L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L113] var_26 = var_26 & mask_SORT_1 [L114] SORT_1 bad_27_arg_0 = var_26; [L115] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND FALSE !(!(cond)) [L115] RET __VERIFIER_assert(!(bad_27_arg_0)) [L117] SORT_1 next_51_arg_1 = var_24; [L118] SORT_1 var_33_arg_0 = state_11; [L119] SORT_1 var_33 = ~var_33_arg_0; [L120] var_33 = var_33 & mask_SORT_1 [L121] SORT_5 var_52_arg_0 = state_29; [L122] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L123] SORT_14 var_52 = var_52_arg_0; [L124] SORT_5 var_53_arg_0 = state_31; [L125] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L126] SORT_14 var_53 = var_53_arg_0; [L127] SORT_14 var_54_arg_0 = var_52; [L128] SORT_14 var_54_arg_1 = var_53; [L129] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L130] SORT_1 var_55_arg_0 = var_33; [L131] SORT_14 var_55_arg_1 = var_15; [L132] SORT_14 var_55_arg_2 = var_54; [L133] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L134] var_55 = var_55 & mask_SORT_14 [L135] SORT_14 next_56_arg_1 = var_55; [L136] SORT_1 var_70_arg_0 = state_38; [L137] SORT_1 var_70_arg_1 = state_40; [L138] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L139] var_70 = var_70 & mask_SORT_1 [L140] SORT_8 var_60_arg_0 = state_36; [L141] var_60_arg_0 = var_60_arg_0 & mask_SORT_8 [L142] SORT_5 var_60 = var_60_arg_0; [L143] SORT_5 var_62_arg_0 = var_60; [L144] SORT_5 var_62_arg_1 = var_61; [L145] SORT_1 var_62 = var_62_arg_0 > var_62_arg_1; [L146] SORT_5 var_64_arg_0 = input_6; [L147] SORT_5 var_64_arg_1 = var_63; [L148] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1; [L149] SORT_1 var_65_arg_0 = var_62; [L150] SORT_1 var_65_arg_1 = var_64; [L151] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1; [L152] SORT_5 var_67_arg_0 = input_7; [L153] SORT_5 var_67_arg_1 = var_66; [L154] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L155] SORT_1 var_68_arg_0 = var_65; [L156] SORT_1 var_68_arg_1 = var_67; [L157] SORT_1 var_68 = var_68_arg_0 & var_68_arg_1; [L158] var_68 = var_68 & mask_SORT_1 [L159] SORT_5 var_46_arg_0 = state_42; [L160] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L161] SORT_14 var_46 = var_46_arg_0; [L162] SORT_5 var_47_arg_0 = state_44; [L163] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L164] SORT_14 var_47 = var_47_arg_0; [L165] SORT_14 var_48_arg_0 = var_46; [L166] SORT_14 var_48_arg_1 = var_47; [L167] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L168] SORT_5 var_58_arg_0 = var_57; [L169] var_58_arg_0 = var_58_arg_0 & mask_SORT_5 [L170] SORT_14 var_58 = var_58_arg_0; [L171] SORT_14 var_59_arg_0 = var_48; [L172] SORT_14 var_59_arg_1 = var_58; [L173] SORT_14 var_59 = var_59_arg_0 + var_59_arg_1; [L174] SORT_1 var_69_arg_0 = var_68; [L175] SORT_14 var_69_arg_1 = var_59; [L176] SORT_14 var_69_arg_2 = var_48; [L177] SORT_14 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L178] SORT_1 var_71_arg_0 = var_70; [L179] SORT_14 var_71_arg_1 = var_69; [L180] SORT_14 var_71_arg_2 = state_18; [L181] SORT_14 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L182] SORT_1 var_72_arg_0 = var_33; [L183] SORT_14 var_72_arg_1 = var_15; [L184] SORT_14 var_72_arg_2 = var_71; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] var_72 = var_72 & mask_SORT_14 [L187] SORT_14 next_73_arg_1 = var_72; [L188] SORT_1 var_74_arg_0 = input_3; [L189] SORT_5 var_74_arg_1 = input_6; [L190] SORT_5 var_74_arg_2 = state_29; [L191] SORT_5 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2; [L192] SORT_1 var_75_arg_0 = var_33; [L193] SORT_5 var_75_arg_1 = var_28; [L194] SORT_5 var_75_arg_2 = var_74; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_5 next_76_arg_1 = var_75; [L197] SORT_1 var_77_arg_0 = input_4; [L198] SORT_5 var_77_arg_1 = input_7; [L199] SORT_5 var_77_arg_2 = state_31; [L200] SORT_5 var_77 = var_77_arg_0 ? var_77_arg_1 : var_77_arg_2; [L201] SORT_1 var_78_arg_0 = var_33; [L202] SORT_5 var_78_arg_1 = var_28; [L203] SORT_5 var_78_arg_2 = var_77; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_5 next_79_arg_1 = var_78; [L206] SORT_1 var_80_arg_0 = var_33; [L207] SORT_8 var_80_arg_1 = input_9; [L208] SORT_8 var_80_arg_2 = state_36; [L209] SORT_8 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2; [L210] SORT_8 next_81_arg_1 = var_80; [L211] SORT_1 var_82_arg_0 = var_33; [L212] SORT_1 var_82_arg_1 = var_24; [L213] SORT_1 var_82_arg_2 = input_3; [L214] SORT_1 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2; [L215] SORT_1 next_83_arg_1 = var_82; [L216] SORT_1 var_84_arg_0 = var_33; [L217] SORT_1 var_84_arg_1 = var_24; [L218] SORT_1 var_84_arg_2 = input_4; [L219] SORT_1 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2; [L220] SORT_1 next_85_arg_1 = var_84; [L221] SORT_1 var_86_arg_0 = input_3; [L222] SORT_5 var_86_arg_1 = input_6; [L223] SORT_5 var_86_arg_2 = state_42; [L224] SORT_5 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; [L225] SORT_1 var_87_arg_0 = var_33; [L226] SORT_5 var_87_arg_1 = var_28; [L227] SORT_5 var_87_arg_2 = var_86; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_5 next_88_arg_1 = var_87; [L230] SORT_1 var_89_arg_0 = input_4; [L231] SORT_5 var_89_arg_1 = input_7; [L232] SORT_5 var_89_arg_2 = state_44; [L233] SORT_5 var_89 = var_89_arg_0 ? var_89_arg_1 : var_89_arg_2; [L234] SORT_1 var_90_arg_0 = var_33; [L235] SORT_5 var_90_arg_1 = var_28; [L236] SORT_5 var_90_arg_2 = var_89; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_5 next_91_arg_1 = var_90; [L240] state_11 = next_51_arg_1 [L241] state_16 = next_56_arg_1 [L242] state_18 = next_73_arg_1 [L243] state_29 = next_76_arg_1 [L244] state_31 = next_79_arg_1 [L245] state_36 = next_81_arg_1 [L246] state_38 = next_83_arg_1 [L247] state_40 = next_85_arg_1 [L248] state_42 = next_88_arg_1 [L249] state_44 = next_91_arg_1 [L88] input_2 = __VERIFIER_nondet_uchar() [L89] input_3 = __VERIFIER_nondet_uchar() [L90] input_3 = input_3 & mask_SORT_1 [L91] input_4 = __VERIFIER_nondet_uchar() [L92] input_4 = input_4 & mask_SORT_1 [L93] input_6 = __VERIFIER_nondet_uint() [L94] input_6 = input_6 & mask_SORT_5 [L95] input_7 = __VERIFIER_nondet_uint() [L96] input_7 = input_7 & mask_SORT_5 [L97] input_9 = __VERIFIER_nondet_ushort() [L100] SORT_1 var_13_arg_0 = state_11; [L101] SORT_1 var_13 = ~var_13_arg_0; [L102] SORT_14 var_20_arg_0 = state_16; [L103] SORT_14 var_20_arg_1 = state_18; [L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L105] SORT_1 var_21_arg_0 = var_13; [L106] SORT_1 var_21_arg_1 = var_20; [L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L108] SORT_1 var_25_arg_0 = var_21; [L109] SORT_1 var_25 = ~var_25_arg_0; [L110] SORT_1 var_26_arg_0 = var_24; [L111] SORT_1 var_26_arg_1 = var_25; [L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L113] var_26 = var_26 & mask_SORT_1 [L114] SORT_1 bad_27_arg_0 = var_26; [L115] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 4 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 4 QuantifiedInterpolants, 1114 SizeOfPredicates, 24 NumberOfNonLiveVariables, 155 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/4 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 proved your program to be incorrect! [2024-10-14 06:36:46,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE