./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.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 a85f457a181079a0b5789d13788d6c7347ae80776212b7f747148ec13e9b6cf1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 18:19:31,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 18:19:31,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-18 18:19:31,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 18:19:31,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 18:19:31,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 18:19:31,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 18:19:31,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 18:19:31,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 18:19:31,942 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 18:19:31,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 18:19:31,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 18:19:31,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 18:19:31,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 18:19:31,944 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 18:19:31,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 18:19:31,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 18:19:31,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 18:19:31,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 18:19:31,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 18:19:31,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 18:19:31,947 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 18:19:31,948 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 18:19:31,948 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 18:19:31,948 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 18:19:31,949 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 18:19:31,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 18:19:31,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 18:19:31,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 18:19:31,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:19:31,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 18:19:31,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 18:19:31,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 18:19:31,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 18:19:31,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 18:19:31,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 18:19:31,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 18:19:31,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 18:19:31,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 18:19:31,953 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 -> a85f457a181079a0b5789d13788d6c7347ae80776212b7f747148ec13e9b6cf1 [2024-11-18 18:19:32,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 18:19:32,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 18:19:32,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 18:19:32,244 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 18:19:32,245 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 18:19:32,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c [2024-11-18 18:19:33,697 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 18:19:33,908 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 18:19:33,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c [2024-11-18 18:19:33,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea5bc59b/57435800425f4db69f416ad51b06f2b1/FLAG279a51dc2 [2024-11-18 18:19:33,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea5bc59b/57435800425f4db69f416ad51b06f2b1 [2024-11-18 18:19:33,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 18:19:33,933 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 18:19:33,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 18:19:33,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 18:19:33,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 18:19:33,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:19:33" (1/1) ... [2024-11-18 18:19:33,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc061de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:33, skipping insertion in model container [2024-11-18 18:19:33,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:19:33" (1/1) ... [2024-11-18 18:19:33,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 18:19:34,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c[1259,1272] [2024-11-18 18:19:34,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:19:34,189 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 18:19:34,198 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c[1259,1272] [2024-11-18 18:19:34,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:19:34,243 INFO L204 MainTranslator]: Completed translation [2024-11-18 18:19:34,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:34 WrapperNode [2024-11-18 18:19:34,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 18:19:34,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 18:19:34,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 18:19:34,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 18:19:34,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:34" (1/1) ... [2024-11-18 18:19:34,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:34" (1/1) ... [2024-11-18 18:19:34,309 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 192 [2024-11-18 18:19:34,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 18:19:34,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 18:19:34,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 18:19:34,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 18:19:34,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:34" (1/1) ... [2024-11-18 18:19:34,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:34" (1/1) ... [2024-11-18 18:19:34,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:34" (1/1) ... [2024-11-18 18:19:34,373 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-11-18 18:19:34,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:34" (1/1) ... [2024-11-18 18:19:34,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:34" (1/1) ... [2024-11-18 18:19:34,385 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:34" (1/1) ... [2024-11-18 18:19:34,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:34" (1/1) ... [2024-11-18 18:19:34,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:34" (1/1) ... [2024-11-18 18:19:34,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:34" (1/1) ... [2024-11-18 18:19:34,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 18:19:34,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 18:19:34,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 18:19:34,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 18:19:34,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:34" (1/1) ... [2024-11-18 18:19:34,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:19:34,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:19:34,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 18:19:34,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 18:19:34,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 18:19:34,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 18:19:34,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 18:19:34,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 18:19:34,606 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 18:19:34,610 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 18:19:34,960 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2024-11-18 18:19:34,960 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 18:19:34,976 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 18:19:34,976 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 18:19:34,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:19:34 BoogieIcfgContainer [2024-11-18 18:19:34,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 18:19:34,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 18:19:34,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 18:19:34,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 18:19:34,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:19:33" (1/3) ... [2024-11-18 18:19:34,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4af103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:19:34, skipping insertion in model container [2024-11-18 18:19:34,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:34" (2/3) ... [2024-11-18 18:19:34,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4af103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:19:34, skipping insertion in model container [2024-11-18 18:19:34,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:19:34" (3/3) ... [2024-11-18 18:19:34,988 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p04.c [2024-11-18 18:19:35,003 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 18:19:35,004 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 18:19:35,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 18:19:35,114 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;@4398416b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 18:19:35,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 18:19:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 18:19:35,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 18:19:35,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:19:35,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:19:35,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:19:35,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:19:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash -685217638, now seen corresponding path program 1 times [2024-11-18 18:19:35,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:19:35,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097182631] [2024-11-18 18:19:35,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:19:35,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:19:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:19:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 18:19:35,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:19:35,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097182631] [2024-11-18 18:19:35,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097182631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:19:35,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:19:35,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 18:19:35,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685020715] [2024-11-18 18:19:35,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:19:35,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 18:19:35,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:19:35,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 18:19:35,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 18:19:35,734 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 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 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 18:19:35,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:19:35,776 INFO L93 Difference]: Finished difference Result 69 states and 99 transitions. [2024-11-18 18:19:35,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 18:19:35,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-11-18 18:19:35,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:19:35,789 INFO L225 Difference]: With dead ends: 69 [2024-11-18 18:19:35,790 INFO L226 Difference]: Without dead ends: 37 [2024-11-18 18:19:35,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 18:19:35,797 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 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-11-18 18:19:35,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 18:19:35,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-18 18:19:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-18 18:19:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 18:19:35,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2024-11-18 18:19:35,828 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 17 [2024-11-18 18:19:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:19:35,829 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2024-11-18 18:19:35,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 18:19:35,829 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2024-11-18 18:19:35,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 18:19:35,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:19:35,831 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:19:35,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 18:19:35,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:19:35,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:19:35,832 INFO L85 PathProgramCache]: Analyzing trace with hash 234784933, now seen corresponding path program 1 times [2024-11-18 18:19:35,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:19:35,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333969750] [2024-11-18 18:19:35,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:19:35,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:19:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:19:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 18:19:35,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:19:35,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333969750] [2024-11-18 18:19:35,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333969750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:19:35,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:19:35,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 18:19:35,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697171074] [2024-11-18 18:19:35,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:19:35,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 18:19:35,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:19:35,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 18:19:35,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 18:19:35,989 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 18:19:36,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:19:36,025 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2024-11-18 18:19:36,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 18:19:36,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-18 18:19:36,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:19:36,026 INFO L225 Difference]: With dead ends: 70 [2024-11-18 18:19:36,027 INFO L226 Difference]: Without dead ends: 39 [2024-11-18 18:19:36,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 18:19:36,029 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 18:19:36,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 18:19:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-18 18:19:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-18 18:19:36,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 18:19:36,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2024-11-18 18:19:36,039 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 18 [2024-11-18 18:19:36,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:19:36,039 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2024-11-18 18:19:36,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 18:19:36,040 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2024-11-18 18:19:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-18 18:19:36,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:19:36,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:19:36,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 18:19:36,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:19:36,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:19:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1885399763, now seen corresponding path program 1 times [2024-11-18 18:19:36,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:19:36,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341737363] [2024-11-18 18:19:36,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:19:36,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:19:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:19:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 18:19:36,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:19:36,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341737363] [2024-11-18 18:19:36,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341737363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:19:36,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:19:36,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 18:19:36,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209160449] [2024-11-18 18:19:36,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:19:36,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 18:19:36,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:19:36,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 18:19:36,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 18:19:36,354 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-11-18 18:19:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:19:36,444 INFO L93 Difference]: Finished difference Result 76 states and 104 transitions. [2024-11-18 18:19:36,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 18:19:36,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 19 [2024-11-18 18:19:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:19:36,445 INFO L225 Difference]: With dead ends: 76 [2024-11-18 18:19:36,446 INFO L226 Difference]: Without dead ends: 43 [2024-11-18 18:19:36,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 18:19:36,449 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 46 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 18:19:36,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 151 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 18:19:36,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-18 18:19:36,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-11-18 18:19:36,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 18:19:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2024-11-18 18:19:36,457 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 19 [2024-11-18 18:19:36,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:19:36,457 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2024-11-18 18:19:36,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-11-18 18:19:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2024-11-18 18:19:36,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-18 18:19:36,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:19:36,459 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] [2024-11-18 18:19:36,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 18:19:36,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:19:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:19:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash -117604312, now seen corresponding path program 1 times [2024-11-18 18:19:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:19:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106819500] [2024-11-18 18:19:36,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:19:36,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:19:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 18:19:36,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 18:19:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 18:19:36,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 18:19:36,605 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 18:19:36,606 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 18:19:36,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 18:19:36,611 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-18 18:19:36,654 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 18:19:36,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:19:36 BoogieIcfgContainer [2024-11-18 18:19:36,660 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 18:19:36,661 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 18:19:36,663 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 18:19:36,663 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 18:19:36,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:19:34" (3/4) ... [2024-11-18 18:19:36,666 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 18:19:36,667 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 18:19:36,668 INFO L158 Benchmark]: Toolchain (without parser) took 2734.51ms. Allocated memory was 161.5MB in the beginning and 245.4MB in the end (delta: 83.9MB). Free memory was 111.3MB in the beginning and 166.7MB in the end (delta: -55.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2024-11-18 18:19:36,668 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 161.5MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 18:19:36,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.44ms. Allocated memory is still 161.5MB. Free memory was 111.3MB in the beginning and 96.1MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 18:19:36,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.42ms. Allocated memory is still 161.5MB. Free memory was 96.1MB in the beginning and 91.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 18:19:36,669 INFO L158 Benchmark]: Boogie Preprocessor took 97.80ms. Allocated memory is still 161.5MB. Free memory was 91.9MB in the beginning and 89.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 18:19:36,669 INFO L158 Benchmark]: RCFGBuilder took 567.63ms. Allocated memory is still 161.5MB. Free memory was 88.8MB in the beginning and 66.3MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-18 18:19:36,670 INFO L158 Benchmark]: TraceAbstraction took 1680.56ms. Allocated memory was 161.5MB in the beginning and 245.4MB in the end (delta: 83.9MB). Free memory was 65.8MB in the beginning and 167.7MB in the end (delta: -102.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 18:19:36,670 INFO L158 Benchmark]: Witness Printer took 6.09ms. Allocated memory is still 245.4MB. Free memory was 167.7MB in the beginning and 166.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 18:19:36,673 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.28ms. Allocated memory is still 161.5MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.44ms. Allocated memory is still 161.5MB. Free memory was 111.3MB in the beginning and 96.1MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.42ms. Allocated memory is still 161.5MB. Free memory was 96.1MB in the beginning and 91.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.80ms. Allocated memory is still 161.5MB. Free memory was 91.9MB in the beginning and 89.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 567.63ms. Allocated memory is still 161.5MB. Free memory was 88.8MB in the beginning and 66.3MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1680.56ms. Allocated memory was 161.5MB in the beginning and 245.4MB in the end (delta: 83.9MB). Free memory was 65.8MB in the beginning and 167.7MB in the end (delta: -102.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.09ms. Allocated memory is still 245.4MB. Free memory was 167.7MB in the beginning and 166.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 106. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 3); [L36] const SORT_7 msb_SORT_7 = (SORT_7)1 << (3 - 1); [L38] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 2); [L39] const SORT_14 msb_SORT_14 = (SORT_14)1 << (2 - 1); [L41] const SORT_7 var_8 = 0; [L42] const SORT_1 var_12 = 0; [L43] const SORT_14 var_16 = 0; [L44] const SORT_1 var_21 = 1; [L45] const SORT_7 var_50 = 1; [L46] const SORT_7 var_52 = 4; [L48] SORT_1 input_2; [L49] SORT_3 input_4; [L50] SORT_5 input_6; [L51] SORT_3 input_25; [L52] SORT_3 input_27; [L53] SORT_3 input_29; [L54] SORT_1 input_31; [L55] SORT_5 input_33; [L56] SORT_3 input_35; [L57] SORT_3 input_37; [L58] SORT_3 input_39; [L59] SORT_3 input_41; [L60] SORT_3 input_43; [L61] SORT_3 input_45; [L62] SORT_3 input_47; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L64] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L66] SORT_7 init_10_arg_1 = var_8; [L67] state_9 = init_10_arg_1 VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L70] input_2 = __VERIFIER_nondet_uchar() [L71] input_4 = __VERIFIER_nondet_uchar() [L72] input_6 = __VERIFIER_nondet_ushort() [L73] input_25 = __VERIFIER_nondet_uchar() [L74] input_27 = __VERIFIER_nondet_uchar() [L75] input_29 = __VERIFIER_nondet_uchar() [L76] input_31 = __VERIFIER_nondet_uchar() [L77] input_33 = __VERIFIER_nondet_ushort() [L78] input_35 = __VERIFIER_nondet_uchar() [L79] input_37 = __VERIFIER_nondet_uchar() [L80] input_39 = __VERIFIER_nondet_uchar() [L81] input_41 = __VERIFIER_nondet_uchar() [L82] input_43 = __VERIFIER_nondet_uchar() [L83] input_45 = __VERIFIER_nondet_uchar() [L84] input_47 = __VERIFIER_nondet_uchar() [L87] SORT_7 var_11_arg_0 = state_9; [L88] SORT_1 var_11 = var_11_arg_0 >> 2; VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_11=0, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L89] EXPR var_11 & mask_SORT_1 VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L89] var_11 = var_11 & mask_SORT_1 [L90] SORT_1 var_13_arg_0 = var_11; [L91] SORT_1 var_13_arg_1 = var_12; [L92] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L93] SORT_7 var_15_arg_0 = state_9; [L94] SORT_14 var_15 = var_15_arg_0 >> 0; VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_13=1, var_15=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L95] EXPR var_15 & mask_SORT_14 VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_13=1, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L95] var_15 = var_15 & mask_SORT_14 [L96] SORT_14 var_17_arg_0 = var_15; [L97] SORT_14 var_17_arg_1 = var_16; [L98] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L99] SORT_1 var_18_arg_0 = var_13; [L100] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_16=0, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_50=1, var_52=4, var_8=0] [L101] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L101] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L102] SORT_1 var_22_arg_0 = var_18; [L103] SORT_1 var_22 = ~var_22_arg_0; [L104] SORT_1 var_23_arg_0 = var_21; [L105] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_16=0, var_21=1, var_23_arg_0=1, var_23_arg_1=-2, var_50=1, var_52=4, var_8=0] [L106] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L106] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L107] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L107] var_23 = var_23 & mask_SORT_1 [L108] SORT_1 bad_24_arg_0 = var_23; [L109] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 417 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 283 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66 IncrementalHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 134 mSDtfsCounter, 66 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=3, InterpolantAutomatonStates: 14, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 18:19:36,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.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 a85f457a181079a0b5789d13788d6c7347ae80776212b7f747148ec13e9b6cf1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 18:19:38,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 18:19:39,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-18 18:19:39,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 18:19:39,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 18:19:39,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 18:19:39,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 18:19:39,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 18:19:39,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 18:19:39,076 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 18:19:39,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 18:19:39,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 18:19:39,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 18:19:39,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 18:19:39,078 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 18:19:39,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 18:19:39,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 18:19:39,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 18:19:39,079 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 18:19:39,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 18:19:39,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 18:19:39,083 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 18:19:39,084 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 18:19:39,084 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 18:19:39,084 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 18:19:39,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 18:19:39,084 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 18:19:39,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 18:19:39,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 18:19:39,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 18:19:39,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 18:19:39,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:19:39,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 18:19:39,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 18:19:39,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 18:19:39,086 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 18:19:39,087 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 18:19:39,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 18:19:39,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 18:19:39,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 18:19:39,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 18:19:39,090 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 -> a85f457a181079a0b5789d13788d6c7347ae80776212b7f747148ec13e9b6cf1 [2024-11-18 18:19:39,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 18:19:39,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 18:19:39,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 18:19:39,462 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 18:19:39,462 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 18:19:39,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c [2024-11-18 18:19:41,101 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 18:19:41,356 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 18:19:41,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c [2024-11-18 18:19:41,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4212759eb/351fc3ff54634008bd438814785dda56/FLAG666fbcfd8 [2024-11-18 18:19:41,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4212759eb/351fc3ff54634008bd438814785dda56 [2024-11-18 18:19:41,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 18:19:41,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 18:19:41,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 18:19:41,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 18:19:41,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 18:19:41,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:19:41" (1/1) ... [2024-11-18 18:19:41,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d347138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:41, skipping insertion in model container [2024-11-18 18:19:41,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:19:41" (1/1) ... [2024-11-18 18:19:41,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 18:19:41,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c[1259,1272] [2024-11-18 18:19:42,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:19:42,017 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 18:19:42,031 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c[1259,1272] [2024-11-18 18:19:42,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:19:42,100 INFO L204 MainTranslator]: Completed translation [2024-11-18 18:19:42,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:42 WrapperNode [2024-11-18 18:19:42,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 18:19:42,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 18:19:42,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 18:19:42,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 18:19:42,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:42" (1/1) ... [2024-11-18 18:19:42,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:42" (1/1) ... [2024-11-18 18:19:42,149 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 136 [2024-11-18 18:19:42,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 18:19:42,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 18:19:42,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 18:19:42,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 18:19:42,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:42" (1/1) ... [2024-11-18 18:19:42,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:42" (1/1) ... [2024-11-18 18:19:42,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:42" (1/1) ... [2024-11-18 18:19:42,189 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-11-18 18:19:42,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:42" (1/1) ... [2024-11-18 18:19:42,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:42" (1/1) ... [2024-11-18 18:19:42,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:42" (1/1) ... [2024-11-18 18:19:42,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:42" (1/1) ... [2024-11-18 18:19:42,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:42" (1/1) ... [2024-11-18 18:19:42,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:42" (1/1) ... [2024-11-18 18:19:42,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 18:19:42,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 18:19:42,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 18:19:42,219 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 18:19:42,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:42" (1/1) ... [2024-11-18 18:19:42,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:19:42,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:19:42,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 18:19:42,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 18:19:42,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 18:19:42,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 18:19:42,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 18:19:42,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 18:19:42,418 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 18:19:42,420 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 18:19:42,623 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-18 18:19:42,627 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 18:19:42,639 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 18:19:42,641 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 18:19:42,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:19:42 BoogieIcfgContainer [2024-11-18 18:19:42,642 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 18:19:42,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 18:19:42,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 18:19:42,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 18:19:42,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:19:41" (1/3) ... [2024-11-18 18:19:42,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adb39f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:19:42, skipping insertion in model container [2024-11-18 18:19:42,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:19:42" (2/3) ... [2024-11-18 18:19:42,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adb39f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:19:42, skipping insertion in model container [2024-11-18 18:19:42,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:19:42" (3/3) ... [2024-11-18 18:19:42,653 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p04.c [2024-11-18 18:19:42,670 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 18:19:42,671 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 18:19:42,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 18:19:42,744 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;@11b7145e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 18:19:42,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 18:19:42,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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-11-18 18:19:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-18 18:19:42,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:19:42,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-18 18:19:42,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:19:42,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:19:42,764 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-18 18:19:42,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 18:19:42,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285307066] [2024-11-18 18:19:42,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:19:42,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 18:19:42,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 18:19:42,784 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 18:19:42,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 18:19:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:19:42,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-18 18:19:42,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:19:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 18:19:43,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 18:19:43,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 18:19:43,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285307066] [2024-11-18 18:19:43,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285307066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:19:43,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:19:43,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 18:19:43,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585721470] [2024-11-18 18:19:43,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:19:43,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 18:19:43,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 18:19:43,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 18:19:43,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 18:19:43,229 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 18:19:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:19:43,281 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-18 18:19:43,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 18:19:43,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-18 18:19:43,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:19:43,290 INFO L225 Difference]: With dead ends: 18 [2024-11-18 18:19:43,291 INFO L226 Difference]: Without dead ends: 10 [2024-11-18 18:19:43,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 18:19:43,299 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 18:19:43,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 18:19:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-18 18:19:43,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-18 18:19:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 18:19:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-18 18:19:43,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-18 18:19:43,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:19:43,332 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-18 18:19:43,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 18:19:43,332 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-18 18:19:43,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-18 18:19:43,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:19:43,333 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-18 18:19:43,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 18:19:43,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 18:19:43,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:19:43,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:19:43,538 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-18 18:19:43,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 18:19:43,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924459112] [2024-11-18 18:19:43,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:19:43,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 18:19:43,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 18:19:43,542 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 18:19:43,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 18:19:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:19:43,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-18 18:19:43,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:19:43,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 18:19:43,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 18:19:49,665 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_9~0#1|))) (let ((.cse5 (= .cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_52~0#1|)))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_8~0#1|)))) (.cse1 (not .cse5)) (.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_12~0#1|)) (.cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_50~0#1|))))))) (.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (and (or (forall ((|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_10|)))))))))))))) (and (or .cse1 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse2))) (_ bv2 32))))))) .cse3)))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (not (= .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse4))) (_ bv2 32)))))))))) .cse5))) (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse2))) (_ bv2 32))))))) .cse3)) .cse1) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (= .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse4))) (_ bv2 32))))))))) .cse5)) (forall ((|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_0~0#1_10| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_10|)))))))))))) (_ bv0 8)))))))) is different from false [2024-11-18 18:19:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-18 18:19:50,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 18:19:50,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924459112] [2024-11-18 18:19:50,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924459112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 18:19:50,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 18:19:50,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-18 18:19:50,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995853900] [2024-11-18 18:19:50,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 18:19:50,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 18:19:50,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 18:19:50,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 18:19:50,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-18 18:19:50,183 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 18:19:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:19:50,642 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-18 18:19:50,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 18:19:50,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) Word has length 8 [2024-11-18 18:19:50,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:19:50,646 INFO L225 Difference]: With dead ends: 15 [2024-11-18 18:19:50,646 INFO L226 Difference]: Without dead ends: 13 [2024-11-18 18:19:50,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=31, Invalid=44, Unknown=1, NotChecked=14, Total=90 [2024-11-18 18:19:50,648 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 18:19:50,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2024-11-18 18:19:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-18 18:19:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-18 18:19:50,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 18:19:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-18 18:19:50,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-18 18:19:50,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:19:50,658 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-18 18:19:50,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 18:19:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-18 18:19:50,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-18 18:19:50,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:19:50,660 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-18 18:19:50,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-18 18:19:50,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 18:19:50,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:19:50,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:19:50,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-18 18:19:50,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 18:19:50,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539596590] [2024-11-18 18:19:50,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 18:19:50,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 18:19:50,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 18:19:50,866 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 18:19:50,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-18 18:19:50,954 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 18:19:50,954 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 18:19:50,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-18 18:19:50,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:19:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 18:19:52,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 18:20:01,162 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-18 18:20:01,163 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 101 [2024-11-18 18:20:01,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 18:20:01,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539596590] [2024-11-18 18:20:01,166 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-18 18:20:01,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-18 18:20:01,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 18:20:01,368 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2024-11-18 18:20:01,373 INFO L158 Benchmark]: Toolchain (without parser) took 19660.52ms. Allocated memory was 62.9MB in the beginning and 111.1MB in the end (delta: 48.2MB). Free memory was 39.7MB in the beginning and 42.7MB in the end (delta: -3.0MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2024-11-18 18:20:01,373 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 62.9MB. Free memory was 39.7MB in the beginning and 39.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 18:20:01,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.52ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 39.5MB in the beginning and 71.5MB in the end (delta: -32.0MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-18 18:20:01,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.31ms. Allocated memory is still 92.3MB. Free memory was 71.5MB in the beginning and 69.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 18:20:01,374 INFO L158 Benchmark]: Boogie Preprocessor took 63.16ms. Allocated memory is still 92.3MB. Free memory was 69.3MB in the beginning and 67.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 18:20:01,375 INFO L158 Benchmark]: RCFGBuilder took 423.97ms. Allocated memory is still 92.3MB. Free memory was 67.3MB in the beginning and 52.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 18:20:01,375 INFO L158 Benchmark]: TraceAbstraction took 18725.49ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 52.1MB in the beginning and 42.7MB in the end (delta: 9.4MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2024-11-18 18:20:01,377 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.19ms. Allocated memory is still 62.9MB. Free memory was 39.7MB in the beginning and 39.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.52ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 39.5MB in the beginning and 71.5MB in the end (delta: -32.0MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.31ms. Allocated memory is still 92.3MB. Free memory was 71.5MB in the beginning and 69.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.16ms. Allocated memory is still 92.3MB. Free memory was 69.3MB in the beginning and 67.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 423.97ms. Allocated memory is still 92.3MB. Free memory was 67.3MB in the beginning and 52.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18725.49ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 52.1MB in the beginning and 42.7MB in the end (delta: 9.4MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")