./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.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-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 11:21:49,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 11:21:49,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 11:21:49,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 11:21:49,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 11:21:49,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 11:21:49,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 11:21:49,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 11:21:49,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 11:21:49,342 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 11:21:49,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 11:21:49,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 11:21:49,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 11:21:49,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 11:21:49,343 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 11:21:49,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 11:21:49,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 11:21:49,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 11:21:49,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 11:21:49,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 11:21:49,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 11:21:49,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 11:21:49,348 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 11:21:49,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 11:21:49,349 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 11:21:49,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 11:21:49,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 11:21:49,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 11:21:49,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 11:21:49,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:21:49,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 11:21:49,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 11:21:49,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 11:21:49,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 11:21:49,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 11:21:49,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 11:21:49,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 11:21:49,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 11:21:49,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 11:21:49,355 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-11-16 11:21:49,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 11:21:49,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 11:21:49,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 11:21:49,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 11:21:49,625 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 11:21:49,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c [2024-11-16 11:21:50,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 11:21:51,045 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 11:21:51,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c [2024-11-16 11:21:51,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6daf42e7/bdc11f12c7754d7991bda0d2603fa77d/FLAGafb664228 [2024-11-16 11:21:51,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6daf42e7/bdc11f12c7754d7991bda0d2603fa77d [2024-11-16 11:21:51,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 11:21:51,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 11:21:51,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 11:21:51,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 11:21:51,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 11:21:51,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:21:51" (1/1) ... [2024-11-16 11:21:51,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72999418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:51, skipping insertion in model container [2024-11-16 11:21:51,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:21:51" (1/1) ... [2024-11-16 11:21:51,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 11:21:51,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c[1244,1257] [2024-11-16 11:21:51,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:21:51,346 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 11:21:51,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c[1244,1257] [2024-11-16 11:21:51,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:21:51,424 INFO L204 MainTranslator]: Completed translation [2024-11-16 11:21:51,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:51 WrapperNode [2024-11-16 11:21:51,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 11:21:51,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 11:21:51,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 11:21:51,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 11:21:51,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:51" (1/1) ... [2024-11-16 11:21:51,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:51" (1/1) ... [2024-11-16 11:21:51,506 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 516 [2024-11-16 11:21:51,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 11:21:51,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 11:21:51,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 11:21:51,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 11:21:51,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:51" (1/1) ... [2024-11-16 11:21:51,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:51" (1/1) ... [2024-11-16 11:21:51,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:51" (1/1) ... [2024-11-16 11:21:51,555 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-16 11:21:51,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:51" (1/1) ... [2024-11-16 11:21:51,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:51" (1/1) ... [2024-11-16 11:21:51,570 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:51" (1/1) ... [2024-11-16 11:21:51,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:51" (1/1) ... [2024-11-16 11:21:51,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:51" (1/1) ... [2024-11-16 11:21:51,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:51" (1/1) ... [2024-11-16 11:21:51,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 11:21:51,594 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 11:21:51,594 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 11:21:51,594 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 11:21:51,595 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:51" (1/1) ... [2024-11-16 11:21:51,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:21:51,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:21:51,625 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 11:21:51,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 11:21:51,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 11:21:51,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 11:21:51,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 11:21:51,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 11:21:51,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 11:21:51,761 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 11:21:51,763 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 11:21:52,428 INFO L? ?]: Removed 210 outVars from TransFormulas that were not future-live. [2024-11-16 11:21:52,429 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 11:21:52,477 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 11:21:52,479 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 11:21:52,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:21:52 BoogieIcfgContainer [2024-11-16 11:21:52,480 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 11:21:52,482 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 11:21:52,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 11:21:52,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 11:21:52,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:21:51" (1/3) ... [2024-11-16 11:21:52,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792ec011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:21:52, skipping insertion in model container [2024-11-16 11:21:52,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:51" (2/3) ... [2024-11-16 11:21:52,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792ec011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:21:52, skipping insertion in model container [2024-11-16 11:21:52,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:21:52" (3/3) ... [2024-11-16 11:21:52,487 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul5.c [2024-11-16 11:21:52,501 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 11:21:52,501 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 11:21:52,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 11:21:52,561 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;@3a97779e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 11:21:52,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 11:21:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 135 states have (on average 1.4814814814814814) internal successors, (200), 136 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:21:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-16 11:21:52,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:21:52,572 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-11-16 11:21:52,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:21:52,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:21:52,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2017711095, now seen corresponding path program 1 times [2024-11-16 11:21:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:21:52,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190520076] [2024-11-16 11:21:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:21:52,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:21:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:21:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:21:53,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:21:53,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190520076] [2024-11-16 11:21:53,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190520076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:21:53,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:21:53,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:21:53,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922239518] [2024-11-16 11:21:53,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:21:53,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:21:53,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:21:53,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:21:53,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:21:53,163 INFO L87 Difference]: Start difference. First operand has 137 states, 135 states have (on average 1.4814814814814814) internal successors, (200), 136 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 10.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-11-16 11:21:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:21:53,260 INFO L93 Difference]: Finished difference Result 229 states and 337 transitions. [2024-11-16 11:21:53,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:21:53,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.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-11-16 11:21:53,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:21:53,268 INFO L225 Difference]: With dead ends: 229 [2024-11-16 11:21:53,269 INFO L226 Difference]: Without dead ends: 134 [2024-11-16 11:21:53,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:21:53,273 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:21:53,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 478 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:21:53,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-16 11:21:53,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-16 11:21:53,302 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-11-16 11:21:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 196 transitions. [2024-11-16 11:21:53,305 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 196 transitions. Word has length 40 [2024-11-16 11:21:53,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:21:53,305 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 196 transitions. [2024-11-16 11:21:53,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.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-11-16 11:21:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 196 transitions. [2024-11-16 11:21:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 11:21:53,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:21:53,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:21:53,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 11:21:53,310 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:21:53,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:21:53,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2020518970, now seen corresponding path program 1 times [2024-11-16 11:21:53,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:21:53,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972721133] [2024-11-16 11:21:53,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:21:53,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:21:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:21:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:21:53,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:21:53,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972721133] [2024-11-16 11:21:53,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972721133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:21:53,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:21:53,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:21:53,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669890684] [2024-11-16 11:21:53,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:21:53,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:21:53,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:21:53,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:21:53,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:21:53,449 INFO L87 Difference]: Start difference. First operand 134 states and 196 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:21:53,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:21:53,542 INFO L93 Difference]: Finished difference Result 228 states and 333 transitions. [2024-11-16 11:21:53,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:21:53,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-16 11:21:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:21:53,543 INFO L225 Difference]: With dead ends: 228 [2024-11-16 11:21:53,543 INFO L226 Difference]: Without dead ends: 136 [2024-11-16 11:21:53,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:21:53,546 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:21:53,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:21:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-16 11:21:53,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-16 11:21:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4666666666666666) internal successors, (198), 135 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:21:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 198 transitions. [2024-11-16 11:21:53,554 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 198 transitions. Word has length 41 [2024-11-16 11:21:53,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:21:53,555 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 198 transitions. [2024-11-16 11:21:53,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:21:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 198 transitions. [2024-11-16 11:21:53,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-16 11:21:53,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:21:53,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:21:53,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 11:21:53,556 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:21:53,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:21:53,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2041177714, now seen corresponding path program 1 times [2024-11-16 11:21:53,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:21:53,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656214440] [2024-11-16 11:21:53,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:21:53,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:21:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:21:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:21:53,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:21:53,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656214440] [2024-11-16 11:21:53,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656214440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:21:53,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:21:53,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:21:53,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316016477] [2024-11-16 11:21:53,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:21:53,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:21:53,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:21:53,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:21:53,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:21:53,879 INFO L87 Difference]: Start difference. First operand 136 states and 198 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:21:54,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:21:54,010 INFO L93 Difference]: Finished difference Result 268 states and 386 transitions. [2024-11-16 11:21:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:21:54,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-16 11:21:54,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:21:54,011 INFO L225 Difference]: With dead ends: 268 [2024-11-16 11:21:54,011 INFO L226 Difference]: Without dead ends: 174 [2024-11-16 11:21:54,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 11:21:54,013 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 80 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:21:54,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 576 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:21:54,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-16 11:21:54,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 154. [2024-11-16 11:21:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 153 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:21:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 224 transitions. [2024-11-16 11:21:54,028 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 224 transitions. Word has length 42 [2024-11-16 11:21:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:21:54,028 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 224 transitions. [2024-11-16 11:21:54,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:21:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2024-11-16 11:21:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-16 11:21:54,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:21:54,030 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:21:54,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 11:21:54,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:21:54,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:21:54,031 INFO L85 PathProgramCache]: Analyzing trace with hash -442304203, now seen corresponding path program 1 times [2024-11-16 11:21:54,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:21:54,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408122834] [2024-11-16 11:21:54,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:21:54,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:21:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:21:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:21:54,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:21:54,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408122834] [2024-11-16 11:21:54,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408122834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:21:54,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:21:54,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 11:21:54,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11537947] [2024-11-16 11:21:54,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:21:54,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 11:21:54,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:21:54,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 11:21:54,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:21:54,303 INFO L87 Difference]: Start difference. First operand 154 states and 224 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:21:54,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:21:54,472 INFO L93 Difference]: Finished difference Result 270 states and 388 transitions. [2024-11-16 11:21:54,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 11:21:54,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-16 11:21:54,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:21:54,474 INFO L225 Difference]: With dead ends: 270 [2024-11-16 11:21:54,475 INFO L226 Difference]: Without dead ends: 176 [2024-11-16 11:21:54,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-16 11:21:54,476 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 81 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:21:54,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 878 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:21:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-16 11:21:54,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 157. [2024-11-16 11:21:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.4615384615384615) internal successors, (228), 156 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:21:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 228 transitions. [2024-11-16 11:21:54,492 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 228 transitions. Word has length 43 [2024-11-16 11:21:54,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:21:54,492 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 228 transitions. [2024-11-16 11:21:54,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:21:54,492 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 228 transitions. [2024-11-16 11:21:54,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-16 11:21:54,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:21:54,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:21:54,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 11:21:54,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:21:54,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:21:54,495 INFO L85 PathProgramCache]: Analyzing trace with hash -55473742, now seen corresponding path program 1 times [2024-11-16 11:21:54,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:21:54,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95992755] [2024-11-16 11:21:54,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:21:54,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:21:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:21:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:21:54,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:21:54,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95992755] [2024-11-16 11:21:54,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95992755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:21:54,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:21:54,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 11:21:54,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359103865] [2024-11-16 11:21:54,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:21:54,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 11:21:54,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:21:54,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 11:21:54,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 11:21:54,849 INFO L87 Difference]: Start difference. First operand 157 states and 228 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:21:55,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:21:55,063 INFO L93 Difference]: Finished difference Result 270 states and 387 transitions. [2024-11-16 11:21:55,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 11:21:55,064 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-16 11:21:55,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:21:55,065 INFO L225 Difference]: With dead ends: 270 [2024-11-16 11:21:55,065 INFO L226 Difference]: Without dead ends: 176 [2024-11-16 11:21:55,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-16 11:21:55,066 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 81 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:21:55,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1012 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:21:55,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-16 11:21:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 161. [2024-11-16 11:21:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.45625) internal successors, (233), 160 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:21:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 233 transitions. [2024-11-16 11:21:55,071 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 233 transitions. Word has length 44 [2024-11-16 11:21:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:21:55,072 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 233 transitions. [2024-11-16 11:21:55,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:21:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 233 transitions. [2024-11-16 11:21:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-16 11:21:55,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:21:55,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:21:55,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 11:21:55,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:21:55,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:21:55,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1292383976, now seen corresponding path program 1 times [2024-11-16 11:21:55,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:21:55,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502552663] [2024-11-16 11:21:55,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:21:55,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:21:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:21:55,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 11:21:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:21:55,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 11:21:55,137 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 11:21:55,138 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 11:21:55,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 11:21:55,142 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 11:21:55,189 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 11:21:55,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:21:55 BoogieIcfgContainer [2024-11-16 11:21:55,191 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 11:21:55,192 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 11:21:55,192 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 11:21:55,192 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 11:21:55,192 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:21:52" (3/4) ... [2024-11-16 11:21:55,194 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 11:21:55,195 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 11:21:55,195 INFO L158 Benchmark]: Toolchain (without parser) took 4121.20ms. Allocated memory was 201.3MB in the beginning and 339.7MB in the end (delta: 138.4MB). Free memory was 127.5MB in the beginning and 160.3MB in the end (delta: -32.8MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. [2024-11-16 11:21:55,195 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 157.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:21:55,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.55ms. Allocated memory is still 201.3MB. Free memory was 127.2MB in the beginning and 109.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 11:21:55,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.75ms. Allocated memory is still 201.3MB. Free memory was 109.0MB in the beginning and 101.3MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 11:21:55,196 INFO L158 Benchmark]: Boogie Preprocessor took 85.84ms. Allocated memory is still 201.3MB. Free memory was 101.3MB in the beginning and 96.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 11:21:55,196 INFO L158 Benchmark]: IcfgBuilder took 886.81ms. Allocated memory is still 201.3MB. Free memory was 96.4MB in the beginning and 135.7MB in the end (delta: -39.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-16 11:21:55,197 INFO L158 Benchmark]: TraceAbstraction took 2708.96ms. Allocated memory was 201.3MB in the beginning and 339.7MB in the end (delta: 138.4MB). Free memory was 134.8MB in the beginning and 160.3MB in the end (delta: -25.5MB). Peak memory consumption was 115.8MB. Max. memory is 16.1GB. [2024-11-16 11:21:55,197 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 339.7MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:21:55,198 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.20ms. Allocated memory is still 201.3MB. Free memory is still 157.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.55ms. Allocated memory is still 201.3MB. Free memory was 127.2MB in the beginning and 109.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.75ms. Allocated memory is still 201.3MB. Free memory was 109.0MB in the beginning and 101.3MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.84ms. Allocated memory is still 201.3MB. Free memory was 101.3MB in the beginning and 96.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 886.81ms. Allocated memory is still 201.3MB. Free memory was 96.4MB in the beginning and 135.7MB in the end (delta: -39.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2708.96ms. Allocated memory was 201.3MB in the beginning and 339.7MB in the end (delta: 138.4MB). Free memory was 134.8MB in the beginning and 160.3MB in the end (delta: -25.5MB). Peak memory consumption was 115.8MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 339.7MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of 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, 137 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 3419 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2631 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 859 IncrementalHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 788 mSDtfsCounter, 859 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=5, InterpolantAutomatonStates: 28, 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, 54 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 618 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-11-16 11:21:55,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.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-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 11:21:57,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 11:21:57,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-16 11:21:57,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 11:21:57,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 11:21:57,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 11:21:57,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 11:21:57,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 11:21:57,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 11:21:57,142 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 11:21:57,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 11:21:57,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 11:21:57,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 11:21:57,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 11:21:57,147 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 11:21:57,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 11:21:57,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 11:21:57,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 11:21:57,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 11:21:57,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 11:21:57,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 11:21:57,149 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 11:21:57,149 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 11:21:57,150 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 11:21:57,150 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 11:21:57,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 11:21:57,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 11:21:57,150 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 11:21:57,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 11:21:57,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 11:21:57,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 11:21:57,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:21:57,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 11:21:57,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 11:21:57,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 11:21:57,152 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 11:21:57,153 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 11:21:57,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 11:21:57,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 11:21:57,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 11:21:57,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 11:21:57,157 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-11-16 11:21:57,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 11:21:57,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 11:21:57,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 11:21:57,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 11:21:57,437 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 11:21:57,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c [2024-11-16 11:21:58,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 11:21:58,986 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 11:21:58,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c [2024-11-16 11:21:59,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10adcc446/b271958ade864194a029fc44ac1caabf/FLAG46dcbfe88 [2024-11-16 11:21:59,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10adcc446/b271958ade864194a029fc44ac1caabf [2024-11-16 11:21:59,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 11:21:59,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 11:21:59,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 11:21:59,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 11:21:59,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 11:21:59,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:21:59" (1/1) ... [2024-11-16 11:21:59,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff0642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:59, skipping insertion in model container [2024-11-16 11:21:59,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:21:59" (1/1) ... [2024-11-16 11:21:59,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 11:21:59,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c[1244,1257] [2024-11-16 11:21:59,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:21:59,303 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 11:21:59,315 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c[1244,1257] [2024-11-16 11:21:59,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:21:59,361 INFO L204 MainTranslator]: Completed translation [2024-11-16 11:21:59,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:59 WrapperNode [2024-11-16 11:21:59,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 11:21:59,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 11:21:59,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 11:21:59,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 11:21:59,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:59" (1/1) ... [2024-11-16 11:21:59,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:59" (1/1) ... [2024-11-16 11:21:59,412 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 268 [2024-11-16 11:21:59,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 11:21:59,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 11:21:59,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 11:21:59,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 11:21:59,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:59" (1/1) ... [2024-11-16 11:21:59,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:59" (1/1) ... [2024-11-16 11:21:59,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:59" (1/1) ... [2024-11-16 11:21:59,457 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-16 11:21:59,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:59" (1/1) ... [2024-11-16 11:21:59,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:59" (1/1) ... [2024-11-16 11:21:59,469 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:59" (1/1) ... [2024-11-16 11:21:59,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:59" (1/1) ... [2024-11-16 11:21:59,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:59" (1/1) ... [2024-11-16 11:21:59,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:59" (1/1) ... [2024-11-16 11:21:59,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 11:21:59,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 11:21:59,485 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 11:21:59,485 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 11:21:59,486 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:59" (1/1) ... [2024-11-16 11:21:59,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:21:59,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:21:59,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 11:21:59,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 11:21:59,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 11:21:59,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 11:21:59,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 11:21:59,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 11:21:59,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 11:21:59,658 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 11:21:59,660 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 11:22:00,009 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-16 11:22:00,009 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 11:22:00,020 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 11:22:00,020 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 11:22:00,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:22:00 BoogieIcfgContainer [2024-11-16 11:22:00,021 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 11:22:00,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 11:22:00,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 11:22:00,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 11:22:00,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:21:59" (1/3) ... [2024-11-16 11:22:00,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c491eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:22:00, skipping insertion in model container [2024-11-16 11:22:00,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:21:59" (2/3) ... [2024-11-16 11:22:00,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c491eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:22:00, skipping insertion in model container [2024-11-16 11:22:00,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:22:00" (3/3) ... [2024-11-16 11:22:00,031 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul5.c [2024-11-16 11:22:00,044 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 11:22:00,045 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 11:22:00,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 11:22:00,103 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;@3c423c0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 11:22:00,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 11:22:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:22:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-16 11:22:00,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:22:00,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-16 11:22:00,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:22:00,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:22:00,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-16 11:22:00,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:22:00,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104489421] [2024-11-16 11:22:00,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:22:00,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 11:22:00,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:22:00,135 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 11:22:00,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 11:22:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:22:00,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-16 11:22:00,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:22:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:22:00,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 11:22:00,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 11:22:00,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104489421] [2024-11-16 11:22:00,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104489421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:22:00,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:22:00,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:22:00,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733555356] [2024-11-16 11:22:00,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:22:00,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:22:00,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 11:22:00,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:22:00,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:22:00,419 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:22:00,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:22:00,547 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-11-16 11:22:00,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:22:00,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-16 11:22:00,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:22:00,554 INFO L225 Difference]: With dead ends: 21 [2024-11-16 11:22:00,554 INFO L226 Difference]: Without dead ends: 10 [2024-11-16 11:22:00,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:22:00,558 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:22:00,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:22:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-16 11:22:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-16 11:22:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:22:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-16 11:22:00,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-16 11:22:00,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:22:00,580 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-16 11:22:00,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:22:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-16 11:22:00,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 11:22:00,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:22:00,581 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:22:00,586 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-11-16 11:22:00,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 11:22:00,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:22:00,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:22:00,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-16 11:22:00,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:22:00,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644303907] [2024-11-16 11:22:00,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:22:00,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 11:22:00,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:22:00,790 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 11:22:00,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 11:22:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:22:00,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 11:22:00,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:22:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:22:01,294 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:22:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:22:05,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 11:22:05,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644303907] [2024-11-16 11:22:05,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644303907] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:22:05,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 11:22:05,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-16 11:22:05,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768953455] [2024-11-16 11:22:05,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 11:22:05,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 11:22:05,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 11:22:05,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 11:22:05,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 11:22:05,500 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:22:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:22:05,783 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-11-16 11:22:05,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 11:22:05,785 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-16 11:22:05,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:22:05,785 INFO L225 Difference]: With dead ends: 16 [2024-11-16 11:22:05,785 INFO L226 Difference]: Without dead ends: 13 [2024-11-16 11:22:05,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 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-11-16 11:22:05,786 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:22:05,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:22:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-16 11:22:05,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-16 11:22:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:22:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-16 11:22:05,796 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2024-11-16 11:22:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:22:05,797 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-16 11:22:05,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:22:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-16 11:22:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 11:22:05,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:22:05,797 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-16 11:22:05,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 11:22:05,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 11:22:05,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:22:05,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:22:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1723041149, now seen corresponding path program 2 times [2024-11-16 11:22:05,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:22:05,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92805621] [2024-11-16 11:22:05,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 11:22:05,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 11:22:05,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:22:06,007 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 11:22:06,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 11:22:06,344 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 11:22:06,344 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-16 11:22:06,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 11:22:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:22:06,602 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-16 11:22:06,602 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 11:22:06,603 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 11:22:06,615 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-11-16 11:22:06,804 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-11-16 11:22:06,808 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-11-16 11:22:06,842 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 11:22:06,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:22:06 BoogieIcfgContainer [2024-11-16 11:22:06,844 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 11:22:06,845 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 11:22:06,845 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 11:22:06,845 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 11:22:06,845 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:22:00" (3/4) ... [2024-11-16 11:22:06,846 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 11:22:06,913 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 11:22:06,913 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 11:22:06,914 INFO L158 Benchmark]: Toolchain (without parser) took 7895.73ms. Allocated memory was 77.6MB in the beginning and 375.4MB in the end (delta: 297.8MB). Free memory was 41.0MB in the beginning and 323.2MB in the end (delta: -282.3MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-16 11:22:06,914 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 77.6MB. Free memory is still 54.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:22:06,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.73ms. Allocated memory is still 77.6MB. Free memory was 40.8MB in the beginning and 46.5MB in the end (delta: -5.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-16 11:22:06,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.91ms. Allocated memory is still 77.6MB. Free memory was 46.5MB in the beginning and 43.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 11:22:06,915 INFO L158 Benchmark]: Boogie Preprocessor took 68.21ms. Allocated memory is still 77.6MB. Free memory was 43.6MB in the beginning and 40.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 11:22:06,915 INFO L158 Benchmark]: IcfgBuilder took 537.12ms. Allocated memory was 77.6MB in the beginning and 109.1MB in the end (delta: 31.5MB). Free memory was 40.4MB in the beginning and 67.4MB in the end (delta: -27.0MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-11-16 11:22:06,915 INFO L158 Benchmark]: TraceAbstraction took 6820.58ms. Allocated memory was 109.1MB in the beginning and 375.4MB in the end (delta: 266.3MB). Free memory was 66.7MB in the beginning and 331.6MB in the end (delta: -264.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:22:06,915 INFO L158 Benchmark]: Witness Printer took 68.82ms. Allocated memory is still 375.4MB. Free memory was 331.6MB in the beginning and 323.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 11:22:06,917 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.18ms. Allocated memory is still 77.6MB. Free memory is still 54.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.73ms. Allocated memory is still 77.6MB. Free memory was 40.8MB in the beginning and 46.5MB in the end (delta: -5.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.91ms. Allocated memory is still 77.6MB. Free memory was 46.5MB in the beginning and 43.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.21ms. Allocated memory is still 77.6MB. Free memory was 43.6MB in the beginning and 40.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 537.12ms. Allocated memory was 77.6MB in the beginning and 109.1MB in the end (delta: 31.5MB). Free memory was 40.4MB in the beginning and 67.4MB in the end (delta: -27.0MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6820.58ms. Allocated memory was 109.1MB in the beginning and 375.4MB in the end (delta: 266.3MB). Free memory was 66.7MB in the beginning and 331.6MB in the end (delta: -264.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 68.82ms. Allocated memory is still 375.4MB. Free memory was 331.6MB in the beginning and 323.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 11 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 21 ConstructedInterpolants, 4 QuantifiedInterpolants, 757 SizeOfPredicates, 25 NumberOfNonLiveVariables, 189 ConjunctsInSsa, 39 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-11-16 11:22:06,953 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE