./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.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 449d552a97f801da54ed90777e1477523d6fe1962bd976a4f73c924025a5f144 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 04:01:32,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 04:01:32,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 04:01:32,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 04:01:32,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 04:01:32,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 04:01:32,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 04:01:32,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 04:01:32,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 04:01:32,335 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 04:01:32,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 04:01:32,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 04:01:32,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 04:01:32,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 04:01:32,338 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 04:01:32,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 04:01:32,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 04:01:32,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 04:01:32,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 04:01:32,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 04:01:32,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 04:01:32,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 04:01:32,344 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 04:01:32,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 04:01:32,344 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 04:01:32,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 04:01:32,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 04:01:32,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 04:01:32,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 04:01:32,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:01:32,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 04:01:32,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 04:01:32,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 04:01:32,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 04:01:32,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 04:01:32,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 04:01:32,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 04:01:32,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 04:01:32,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 04:01:32,347 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 -> 449d552a97f801da54ed90777e1477523d6fe1962bd976a4f73c924025a5f144 [2024-10-24 04:01:32,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 04:01:32,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 04:01:32,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 04:01:32,583 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 04:01:32,583 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 04:01:32,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c [2024-10-24 04:01:34,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 04:01:34,186 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 04:01:34,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c [2024-10-24 04:01:34,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f199ca04/c9857f7811a74ef9a8240bcb857bd9e8/FLAG18b45dd12 [2024-10-24 04:01:34,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f199ca04/c9857f7811a74ef9a8240bcb857bd9e8 [2024-10-24 04:01:34,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 04:01:34,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 04:01:34,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 04:01:34,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 04:01:34,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 04:01:34,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:01:34" (1/1) ... [2024-10-24 04:01:34,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee45857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:34, skipping insertion in model container [2024-10-24 04:01:34,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:01:34" (1/1) ... [2024-10-24 04:01:34,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 04:01:34,787 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c[1249,1262] [2024-10-24 04:01:34,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:01:34,852 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 04:01:34,862 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c[1249,1262] [2024-10-24 04:01:34,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:01:34,912 INFO L204 MainTranslator]: Completed translation [2024-10-24 04:01:34,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:34 WrapperNode [2024-10-24 04:01:34,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 04:01:34,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 04:01:34,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 04:01:34,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 04:01:34,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:34" (1/1) ... [2024-10-24 04:01:34,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:34" (1/1) ... [2024-10-24 04:01:35,024 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 420 [2024-10-24 04:01:35,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 04:01:35,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 04:01:35,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 04:01:35,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 04:01:35,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:34" (1/1) ... [2024-10-24 04:01:35,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:34" (1/1) ... [2024-10-24 04:01:35,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:34" (1/1) ... [2024-10-24 04:01:35,124 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 04:01:35,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:34" (1/1) ... [2024-10-24 04:01:35,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:34" (1/1) ... [2024-10-24 04:01:35,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:34" (1/1) ... [2024-10-24 04:01:35,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:34" (1/1) ... [2024-10-24 04:01:35,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:34" (1/1) ... [2024-10-24 04:01:35,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:34" (1/1) ... [2024-10-24 04:01:35,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 04:01:35,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 04:01:35,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 04:01:35,170 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 04:01:35,171 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:34" (1/1) ... [2024-10-24 04:01:35,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:01:35,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 04:01:35,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 04:01:35,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 04:01:35,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 04:01:35,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 04:01:35,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 04:01:35,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 04:01:35,387 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 04:01:35,389 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 04:01:35,832 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2024-10-24 04:01:35,832 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 04:01:35,859 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 04:01:35,860 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 04:01:35,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:01:35 BoogieIcfgContainer [2024-10-24 04:01:35,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 04:01:35,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 04:01:35,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 04:01:35,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 04:01:35,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:01:34" (1/3) ... [2024-10-24 04:01:35,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da920a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:01:35, skipping insertion in model container [2024-10-24 04:01:35,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:34" (2/3) ... [2024-10-24 04:01:35,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da920a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:01:35, skipping insertion in model container [2024-10-24 04:01:35,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:01:35" (3/3) ... [2024-10-24 04:01:35,868 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v3.c [2024-10-24 04:01:35,880 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 04:01:35,880 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 04:01:35,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 04:01:35,924 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;@5600e222, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 04:01:35,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 04:01:35,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 89 states have (on average 1.5056179775280898) internal successors, (134), 90 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:35,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 04:01:35,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:01:35,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:01:35,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:01:35,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:01:35,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1271046549, now seen corresponding path program 1 times [2024-10-24 04:01:35,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:01:35,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338730786] [2024-10-24 04:01:35,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:01:35,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:01:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:01:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:01:36,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:01:36,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338730786] [2024-10-24 04:01:36,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338730786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:01:36,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:01:36,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 04:01:36,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505145657] [2024-10-24 04:01:36,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:01:36,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:01:36,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:01:36,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:01:36,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:01:36,485 INFO L87 Difference]: Start difference. First operand has 91 states, 89 states have (on average 1.5056179775280898) internal successors, (134), 90 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:01:36,535 INFO L93 Difference]: Finished difference Result 134 states and 198 transitions. [2024-10-24 04:01:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:01:36,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-24 04:01:36,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:01:36,543 INFO L225 Difference]: With dead ends: 134 [2024-10-24 04:01:36,543 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 04:01:36,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:01:36,551 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:01:36,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:01:36,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 04:01:36,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-24 04:01:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 91 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:36,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-10-24 04:01:36,584 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 38 [2024-10-24 04:01:36,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:01:36,584 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-10-24 04:01:36,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-10-24 04:01:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 04:01:36,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:01:36,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:01:36,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 04:01:36,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:01:36,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:01:36,588 INFO L85 PathProgramCache]: Analyzing trace with hash 749432729, now seen corresponding path program 1 times [2024-10-24 04:01:36,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:01:36,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882062202] [2024-10-24 04:01:36,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:01:36,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:01:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:01:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:01:36,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:01:36,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882062202] [2024-10-24 04:01:36,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882062202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:01:36,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:01:36,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 04:01:36,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882915990] [2024-10-24 04:01:36,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:01:36,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:01:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:01:36,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:01:36,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:01:36,770 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:36,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:01:36,808 INFO L93 Difference]: Finished difference Result 137 states and 198 transitions. [2024-10-24 04:01:36,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:01:36,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-24 04:01:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:01:36,810 INFO L225 Difference]: With dead ends: 137 [2024-10-24 04:01:36,810 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 04:01:36,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:01:36,813 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:01:36,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:01:36,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 04:01:36,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-24 04:01:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 93 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-24 04:01:36,822 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 39 [2024-10-24 04:01:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:01:36,823 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-24 04:01:36,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-24 04:01:36,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 04:01:36,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:01:36,826 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:01:36,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 04:01:36,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:01:36,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:01:36,827 INFO L85 PathProgramCache]: Analyzing trace with hash 659612398, now seen corresponding path program 1 times [2024-10-24 04:01:36,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:01:36,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029658567] [2024-10-24 04:01:36,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:01:36,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:01:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:01:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:01:37,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:01:37,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029658567] [2024-10-24 04:01:37,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029658567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:01:37,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:01:37,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 04:01:37,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313188676] [2024-10-24 04:01:37,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:01:37,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:01:37,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:01:37,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:01:37,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:01:37,035 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:01:37,065 INFO L93 Difference]: Finished difference Result 137 states and 197 transitions. [2024-10-24 04:01:37,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:01:37,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-10-24 04:01:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:01:37,067 INFO L225 Difference]: With dead ends: 137 [2024-10-24 04:01:37,067 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 04:01:37,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 04:01:37,068 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 100 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:01:37,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 245 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:01:37,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 04:01:37,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-24 04:01:37,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4505494505494505) internal successors, (132), 91 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:37,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-10-24 04:01:37,073 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 40 [2024-10-24 04:01:37,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:01:37,074 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-10-24 04:01:37,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-10-24 04:01:37,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-24 04:01:37,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:01:37,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:01:37,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 04:01:37,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:01:37,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:01:37,076 INFO L85 PathProgramCache]: Analyzing trace with hash 537693180, now seen corresponding path program 1 times [2024-10-24 04:01:37,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:01:37,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041831429] [2024-10-24 04:01:37,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:01:37,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:01:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 04:01:37,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 04:01:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 04:01:37,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 04:01:37,172 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 04:01:37,173 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 04:01:37,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 04:01:37,177 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 04:01:37,211 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 04:01:37,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:01:37 BoogieIcfgContainer [2024-10-24 04:01:37,217 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 04:01:37,218 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 04:01:37,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 04:01:37,218 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 04:01:37,218 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:01:35" (3/4) ... [2024-10-24 04:01:37,220 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 04:01:37,221 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 04:01:37,222 INFO L158 Benchmark]: Toolchain (without parser) took 2630.07ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 79.7MB in the beginning and 153.9MB in the end (delta: -74.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:01:37,222 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:01:37,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.05ms. Allocated memory is still 151.0MB. Free memory was 79.5MB in the beginning and 61.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 04:01:37,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.08ms. Allocated memory is still 151.0MB. Free memory was 61.5MB in the beginning and 117.4MB in the end (delta: -55.9MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-10-24 04:01:37,223 INFO L158 Benchmark]: Boogie Preprocessor took 143.26ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 117.4MB in the beginning and 175.4MB in the end (delta: -58.1MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-10-24 04:01:37,223 INFO L158 Benchmark]: RCFGBuilder took 691.75ms. Allocated memory is still 211.8MB. Free memory was 174.4MB in the beginning and 119.9MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-10-24 04:01:37,223 INFO L158 Benchmark]: TraceAbstraction took 1354.17ms. Allocated memory is still 211.8MB. Free memory was 118.8MB in the beginning and 154.9MB in the end (delta: -36.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:01:37,224 INFO L158 Benchmark]: Witness Printer took 3.57ms. Allocated memory is still 211.8MB. Free memory was 154.9MB in the beginning and 153.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 04:01:37,226 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.16ms. Allocated memory is still 151.0MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.05ms. Allocated memory is still 151.0MB. Free memory was 79.5MB in the beginning and 61.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.08ms. Allocated memory is still 151.0MB. Free memory was 61.5MB in the beginning and 117.4MB in the end (delta: -55.9MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 143.26ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 117.4MB in the beginning and 175.4MB in the end (delta: -58.1MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * RCFGBuilder took 691.75ms. Allocated memory is still 211.8MB. Free memory was 174.4MB in the beginning and 119.9MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1354.17ms. Allocated memory is still 211.8MB. Free memory was 118.8MB in the beginning and 154.9MB in the end (delta: -36.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.57ms. Allocated memory is still 211.8MB. Free memory was 154.9MB in the beginning and 153.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 102. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_18 = 1; [L34] const SORT_5 var_28 = 0; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L38] SORT_1 input_4; [L39] SORT_5 input_6; [L40] SORT_5 input_7; [L41] SORT_5 input_8; [L42] SORT_5 input_9; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L44] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L45] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L46] SORT_1 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L47] SORT_1 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L48] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L49] SORT_5 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L50] SORT_5 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L51] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L52] SORT_5 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L53] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L54] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L55] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_12_arg_1 = var_10; [L58] state_11 = init_12_arg_1 [L59] SORT_1 init_14_arg_1 = var_10; [L60] state_13 = init_14_arg_1 [L61] SORT_1 init_23_arg_1 = var_10; [L62] state_22 = init_23_arg_1 [L63] SORT_1 init_25_arg_1 = var_10; [L64] state_24 = init_25_arg_1 [L65] SORT_1 init_27_arg_1 = var_10; [L66] state_26 = init_27_arg_1 [L67] SORT_5 init_30_arg_1 = var_28; [L68] state_29 = init_30_arg_1 [L69] SORT_5 init_32_arg_1 = var_28; [L70] state_31 = init_32_arg_1 [L71] SORT_1 init_34_arg_1 = var_10; [L72] state_33 = init_34_arg_1 [L73] SORT_5 init_36_arg_1 = var_28; [L74] state_35 = init_36_arg_1 [L75] SORT_1 init_38_arg_1 = var_10; [L76] state_37 = init_38_arg_1 [L77] SORT_1 init_41_arg_1 = var_10; [L78] state_40 = init_41_arg_1 [L79] SORT_1 init_43_arg_1 = var_10; [L80] state_42 = init_43_arg_1 VAL [mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] EXPR input_7 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] EXPR input_8 & mask_SORT_5 VAL [input_7=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] EXPR input_9 & mask_SORT_5 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_28=0] [L102] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] EXPR var_20 & mask_SORT_5 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 1006 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 625 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 381 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 04:01:37,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.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 449d552a97f801da54ed90777e1477523d6fe1962bd976a4f73c924025a5f144 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 04:01:39,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 04:01:39,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-24 04:01:39,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 04:01:39,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 04:01:39,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 04:01:39,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 04:01:39,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 04:01:39,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 04:01:39,515 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 04:01:39,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 04:01:39,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 04:01:39,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 04:01:39,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 04:01:39,516 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 04:01:39,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 04:01:39,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 04:01:39,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 04:01:39,517 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 04:01:39,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 04:01:39,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 04:01:39,521 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 04:01:39,521 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 04:01:39,522 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 04:01:39,522 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 04:01:39,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 04:01:39,522 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 04:01:39,522 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 04:01:39,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 04:01:39,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 04:01:39,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 04:01:39,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:01:39,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 04:01:39,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 04:01:39,524 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 04:01:39,524 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 04:01:39,524 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 04:01:39,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 04:01:39,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 04:01:39,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 04:01:39,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 04:01:39,529 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 04:01:39,529 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 -> 449d552a97f801da54ed90777e1477523d6fe1962bd976a4f73c924025a5f144 [2024-10-24 04:01:39,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 04:01:39,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 04:01:39,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 04:01:39,880 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 04:01:39,880 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 04:01:39,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c [2024-10-24 04:01:41,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 04:01:41,655 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 04:01:41,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c [2024-10-24 04:01:41,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddc5b9d2c/e2abe2ce859c410fb6d13c1e7b4f570c/FLAG7d1c6e6cd [2024-10-24 04:01:41,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddc5b9d2c/e2abe2ce859c410fb6d13c1e7b4f570c [2024-10-24 04:01:41,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 04:01:41,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 04:01:41,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 04:01:41,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 04:01:41,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 04:01:41,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:01:41" (1/1) ... [2024-10-24 04:01:41,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f1c59e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:41, skipping insertion in model container [2024-10-24 04:01:41,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:01:41" (1/1) ... [2024-10-24 04:01:41,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 04:01:41,879 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c[1249,1262] [2024-10-24 04:01:41,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:01:41,958 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 04:01:41,966 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c[1249,1262] [2024-10-24 04:01:42,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:01:42,022 INFO L204 MainTranslator]: Completed translation [2024-10-24 04:01:42,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:42 WrapperNode [2024-10-24 04:01:42,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 04:01:42,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 04:01:42,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 04:01:42,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 04:01:42,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:42" (1/1) ... [2024-10-24 04:01:42,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:42" (1/1) ... [2024-10-24 04:01:42,069 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 252 [2024-10-24 04:01:42,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 04:01:42,071 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 04:01:42,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 04:01:42,072 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 04:01:42,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:42" (1/1) ... [2024-10-24 04:01:42,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:42" (1/1) ... [2024-10-24 04:01:42,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:42" (1/1) ... [2024-10-24 04:01:42,114 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 04:01:42,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:42" (1/1) ... [2024-10-24 04:01:42,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:42" (1/1) ... [2024-10-24 04:01:42,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:42" (1/1) ... [2024-10-24 04:01:42,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:42" (1/1) ... [2024-10-24 04:01:42,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:42" (1/1) ... [2024-10-24 04:01:42,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:42" (1/1) ... [2024-10-24 04:01:42,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 04:01:42,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 04:01:42,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 04:01:42,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 04:01:42,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:42" (1/1) ... [2024-10-24 04:01:42,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:01:42,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 04:01:42,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 04:01:42,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 04:01:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 04:01:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 04:01:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 04:01:42,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 04:01:42,298 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 04:01:42,300 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 04:01:42,574 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-10-24 04:01:42,577 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 04:01:42,610 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 04:01:42,611 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 04:01:42,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:01:42 BoogieIcfgContainer [2024-10-24 04:01:42,611 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 04:01:42,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 04:01:42,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 04:01:42,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 04:01:42,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:01:41" (1/3) ... [2024-10-24 04:01:42,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78439a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:01:42, skipping insertion in model container [2024-10-24 04:01:42,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:42" (2/3) ... [2024-10-24 04:01:42,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78439a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:01:42, skipping insertion in model container [2024-10-24 04:01:42,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:01:42" (3/3) ... [2024-10-24 04:01:42,620 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v3.c [2024-10-24 04:01:42,637 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 04:01:42,638 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 04:01:42,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 04:01:42,695 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;@774916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 04:01:42,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 04:01:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:42,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 04:01:42,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:01:42,705 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 04:01:42,706 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:01:42,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:01:42,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-24 04:01:42,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:01:42,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122158068] [2024-10-24 04:01:42,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:01:42,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:01:42,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:01:42,725 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 04:01:42,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 04:01:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:01:42,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 04:01:42,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:01:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:01:42,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 04:01:42,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 04:01:42,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122158068] [2024-10-24 04:01:42,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122158068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:01:42,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:01:42,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 04:01:42,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121753188] [2024-10-24 04:01:42,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:01:42,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:01:42,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 04:01:42,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:01:42,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:01:42,976 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:01:43,007 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-24 04:01:43,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:01:43,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-24 04:01:43,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:01:43,016 INFO L225 Difference]: With dead ends: 14 [2024-10-24 04:01:43,016 INFO L226 Difference]: Without dead ends: 8 [2024-10-24 04:01:43,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:01:43,022 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:01:43,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:01:43,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-24 04:01:43,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-24 04:01:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-24 04:01:43,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-24 04:01:43,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:01:43,045 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-24 04:01:43,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:43,045 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-24 04:01:43,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 04:01:43,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:01:43,046 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-24 04:01:43,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 04:01:43,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:01:43,249 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:01:43,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:01:43,250 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-24 04:01:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:01:43,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129719086] [2024-10-24 04:01:43,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:01:43,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:01:43,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:01:43,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 04:01:43,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 04:01:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:01:43,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 04:01:43,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:01:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:01:43,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 04:01:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:01:45,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 04:01:45,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129719086] [2024-10-24 04:01:45,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129719086] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 04:01:45,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 04:01:45,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-24 04:01:45,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680490703] [2024-10-24 04:01:45,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 04:01:45,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 04:01:45,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 04:01:45,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 04:01:45,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 04:01:45,762 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:46,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:01:46,058 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-24 04:01:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 04:01:46,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 04:01:46,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:01:46,059 INFO L225 Difference]: With dead ends: 13 [2024-10-24 04:01:46,059 INFO L226 Difference]: Without dead ends: 11 [2024-10-24 04:01:46,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-24 04:01:46,060 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 04:01:46,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 04:01:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-24 04:01:46,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-24 04:01:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-24 04:01:46,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-24 04:01:46,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:01:46,063 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-24 04:01:46,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-24 04:01:46,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 04:01:46,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:01:46,064 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-24 04:01:46,068 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-10-24 04:01:46,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:01:46,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:01:46,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:01:46,269 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-24 04:01:46,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:01:46,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570318691] [2024-10-24 04:01:46,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 04:01:46,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:01:46,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:01:46,272 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 04:01:46,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 04:01:46,428 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 04:01:46,428 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 04:01:46,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 04:01:46,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:01:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:01:47,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 04:01:58,512 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse23 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|))) (let ((.cse1 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_21| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_21|))))))))) (.cse2 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_21| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_21|)))) .cse23)) (_ bv0 8)))) (.cse8 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_31~0#1|))) .cse23)))) (.cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_26~0#1|)))) (.cse0 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_29~0#1|)))) .cse23))))) (let ((.cse13 (not .cse0)) (.cse4 (bvneg .cse9)) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_40~0#1|)))))) (.cse7 (not .cse8)) (.cse11 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_24~0#1|)) (.cse12 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_22~0#1|)) (.cse14 (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_10~0#1|))))) (let ((.cse21 (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_28~0#1|))) .cse23)) (_ bv0 8))) (.cse20 ((_ zero_extend 24) ((_ extract 7 0) .cse18)))) (and (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvmul .cse18 (_ bv2 32)))))))) .cse19))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 .cse20)))))) .cse21) .cse1 (or (not .cse21) .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 (bvneg .cse18)))))))) .cse22))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse20)))))))))))) (and (or .cse0 (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 .cse12))))))))) (and .cse1 (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse5 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse4))))))) .cse5))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 .cse5)))))) .cse7) (or .cse2 .cse8 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse10 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse9))))))) .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 .cse10)))))))))) (or .cse13 .cse14) (or .cse13 (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg .cse11) .cse12))))))))) (and (or .cse2 .cse8 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 .cse9))))))) .cse16))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 .cse16))))))) .cse1 (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 .cse4))))))) .cse17))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 .cse17)))))) .cse7)))) (or .cse0 .cse14))))) is different from false [2024-10-24 04:02:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-24 04:02:01,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 04:02:01,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570318691] [2024-10-24 04:02:01,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570318691] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 04:02:01,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 04:02:01,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-24 04:02:01,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084775019] [2024-10-24 04:02:01,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 04:02:01,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 04:02:01,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 04:02:01,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 04:02:01,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2024-10-24 04:02:01,291 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:02:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:02:05,742 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-10-24 04:02:05,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 04:02:05,743 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 10 [2024-10-24 04:02:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:02:05,743 INFO L225 Difference]: With dead ends: 16 [2024-10-24 04:02:05,743 INFO L226 Difference]: Without dead ends: 14 [2024-10-24 04:02:05,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=55, Invalid=130, Unknown=1, NotChecked=24, Total=210 [2024-10-24 04:02:05,745 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 04:02:05,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 8 Unchecked, 0.4s Time] [2024-10-24 04:02:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-24 04:02:05,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-24 04:02:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-10-24 04:02:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-24 04:02:05,748 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2024-10-24 04:02:05,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:02:05,748 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-24 04:02:05,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:02:05,749 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-24 04:02:05,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 04:02:05,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:02:05,749 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-24 04:02:05,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 04:02:05,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:02:05,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:02:05,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:02:05,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 3 times [2024-10-24 04:02:05,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:02:05,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671441419] [2024-10-24 04:02:05,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 04:02:05,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:02:05,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:02:05,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 04:02:05,956 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 (5)] Waiting until timeout for monitored process [2024-10-24 04:02:06,067 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-24 04:02:06,067 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-24 04:02:06,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 04:02:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 04:02:06,247 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 04:02:06,247 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 04:02:06,248 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 04:02:06,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 04:02:06,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:02:06,453 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-24 04:02:06,502 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 04:02:06,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:02:06 BoogieIcfgContainer [2024-10-24 04:02:06,508 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 04:02:06,509 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 04:02:06,512 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 04:02:06,512 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 04:02:06,513 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:01:42" (3/4) ... [2024-10-24 04:02:06,513 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 04:02:06,600 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 04:02:06,601 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 04:02:06,601 INFO L158 Benchmark]: Toolchain (without parser) took 24921.26ms. Allocated memory was 77.6MB in the beginning and 180.4MB in the end (delta: 102.8MB). Free memory was 39.3MB in the beginning and 51.4MB in the end (delta: -12.1MB). Peak memory consumption was 90.0MB. Max. memory is 16.1GB. [2024-10-24 04:02:06,601 INFO L158 Benchmark]: CDTParser took 3.25ms. Allocated memory is still 77.6MB. Free memory is still 59.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:02:06,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.92ms. Allocated memory is still 77.6MB. Free memory was 39.0MB in the beginning and 47.5MB in the end (delta: -8.4MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-10-24 04:02:06,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.88ms. Allocated memory is still 77.6MB. Free memory was 47.5MB in the beginning and 44.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 04:02:06,603 INFO L158 Benchmark]: Boogie Preprocessor took 66.98ms. Allocated memory is still 77.6MB. Free memory was 44.8MB in the beginning and 41.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 04:02:06,603 INFO L158 Benchmark]: RCFGBuilder took 470.97ms. Allocated memory was 77.6MB in the beginning and 123.7MB in the end (delta: 46.1MB). Free memory was 41.5MB in the beginning and 82.9MB in the end (delta: -41.4MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-10-24 04:02:06,613 INFO L158 Benchmark]: TraceAbstraction took 23894.20ms. Allocated memory was 123.7MB in the beginning and 180.4MB in the end (delta: 56.6MB). Free memory was 81.8MB in the beginning and 60.8MB in the end (delta: 20.9MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-10-24 04:02:06,613 INFO L158 Benchmark]: Witness Printer took 91.96ms. Allocated memory is still 180.4MB. Free memory was 60.8MB in the beginning and 51.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 04:02:06,614 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.25ms. Allocated memory is still 77.6MB. Free memory is still 59.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.92ms. Allocated memory is still 77.6MB. Free memory was 39.0MB in the beginning and 47.5MB in the end (delta: -8.4MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.88ms. Allocated memory is still 77.6MB. Free memory was 47.5MB in the beginning and 44.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.98ms. Allocated memory is still 77.6MB. Free memory was 44.8MB in the beginning and 41.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 470.97ms. Allocated memory was 77.6MB in the beginning and 123.7MB in the end (delta: 46.1MB). Free memory was 41.5MB in the beginning and 82.9MB in the end (delta: -41.4MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23894.20ms. Allocated memory was 123.7MB in the beginning and 180.4MB in the end (delta: 56.6MB). Free memory was 81.8MB in the beginning and 60.8MB in the end (delta: 20.9MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * Witness Printer took 91.96ms. Allocated memory is still 180.4MB. Free memory was 60.8MB in the beginning and 51.4MB in the end (delta: 9.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 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_18 = 1; [L34] const SORT_5 var_28 = 0; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L38] SORT_1 input_4; [L39] SORT_5 input_6; [L40] SORT_5 input_7; [L41] SORT_5 input_8; [L42] SORT_5 input_9; [L44] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] SORT_1 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] SORT_5 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] SORT_5 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] SORT_5 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_12_arg_1 = var_10; [L58] state_11 = init_12_arg_1 [L59] SORT_1 init_14_arg_1 = var_10; [L60] state_13 = init_14_arg_1 [L61] SORT_1 init_23_arg_1 = var_10; [L62] state_22 = init_23_arg_1 [L63] SORT_1 init_25_arg_1 = var_10; [L64] state_24 = init_25_arg_1 [L65] SORT_1 init_27_arg_1 = var_10; [L66] state_26 = init_27_arg_1 [L67] SORT_5 init_30_arg_1 = var_28; [L68] state_29 = init_30_arg_1 [L69] SORT_5 init_32_arg_1 = var_28; [L70] state_31 = init_32_arg_1 [L71] SORT_1 init_34_arg_1 = var_10; [L72] state_33 = init_34_arg_1 [L73] SORT_5 init_36_arg_1 = var_28; [L74] state_35 = init_36_arg_1 [L75] SORT_1 init_38_arg_1 = var_10; [L76] state_37 = init_38_arg_1 [L77] SORT_1 init_41_arg_1 = var_10; [L78] state_40 = init_41_arg_1 [L79] SORT_1 init_43_arg_1 = var_10; [L80] state_42 = init_43_arg_1 VAL [mask_SORT_1=-1, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.8s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 7 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 33 ConstructedInterpolants, 14 QuantifiedInterpolants, 3138 SizeOfPredicates, 17 NumberOfNonLiveVariables, 216 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-24 04:02:06,839 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-24 04:02:06,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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