./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1ef8d174762b17df623a48d7afe94f1e8bc5e2233dcaad9b42847f8ac912d010 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:00:15,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:00:15,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 07:00:15,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:00:15,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:00:15,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:00:15,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:00:15,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:00:15,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:00:15,819 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:00:15,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:00:15,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:00:15,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:00:15,821 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:00:15,821 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:00:15,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:00:15,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:00:15,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:00:15,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:00:15,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:00:15,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:00:15,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:00:15,824 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:00:15,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:00:15,825 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:00:15,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:00:15,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:00:15,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:00:15,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:00:15,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:00:15,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:00:15,827 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:00:15,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:00:15,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:00:15,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:00:15,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:00:15,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:00:15,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:00:15,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:00:15,830 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-clean/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-clean/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 -> 1ef8d174762b17df623a48d7afe94f1e8bc5e2233dcaad9b42847f8ac912d010 [2024-10-11 07:00:16,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:00:16,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:00:16,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:00:16,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:00:16,166 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:00:16,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2024-10-11 07:00:17,617 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:00:17,845 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:00:17,845 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2024-10-11 07:00:17,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d19071848/7bc6715be84c4bde90f7797e3729d28c/FLAGdb8061860 [2024-10-11 07:00:18,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d19071848/7bc6715be84c4bde90f7797e3729d28c [2024-10-11 07:00:18,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:00:18,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:00:18,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:00:18,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:00:18,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:00:18,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:00:18" (1/1) ... [2024-10-11 07:00:18,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39540531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:18, skipping insertion in model container [2024-10-11 07:00:18,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:00:18" (1/1) ... [2024-10-11 07:00:18,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:00:18,484 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c[1258,1271] [2024-10-11 07:00:18,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:00:18,638 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:00:18,650 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c[1258,1271] [2024-10-11 07:00:18,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:00:18,750 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:00:18,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:18 WrapperNode [2024-10-11 07:00:18,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:00:18,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:00:18,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:00:18,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:00:18,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:18" (1/1) ... [2024-10-11 07:00:18,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:18" (1/1) ... [2024-10-11 07:00:18,842 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 618 [2024-10-11 07:00:18,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:00:18,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:00:18,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:00:18,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:00:18,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:18" (1/1) ... [2024-10-11 07:00:18,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:18" (1/1) ... [2024-10-11 07:00:18,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:18" (1/1) ... [2024-10-11 07:00:18,923 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:00:18,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:18" (1/1) ... [2024-10-11 07:00:18,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:18" (1/1) ... [2024-10-11 07:00:18,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:18" (1/1) ... [2024-10-11 07:00:18,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:18" (1/1) ... [2024-10-11 07:00:18,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:18" (1/1) ... [2024-10-11 07:00:18,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:18" (1/1) ... [2024-10-11 07:00:19,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:00:19,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:00:19,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:00:19,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:00:19,007 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:18" (1/1) ... [2024-10-11 07:00:19,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:00:19,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:00:19,040 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:00:19,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:00:19,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:00:19,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:00:19,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:00:19,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:00:19,239 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:00:19,242 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:00:20,069 INFO L? ?]: Removed 316 outVars from TransFormulas that were not future-live. [2024-10-11 07:00:20,070 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:00:20,106 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:00:20,106 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:00:20,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:00:20 BoogieIcfgContainer [2024-10-11 07:00:20,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:00:20,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:00:20,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:00:20,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:00:20,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:00:18" (1/3) ... [2024-10-11 07:00:20,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15755cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:00:20, skipping insertion in model container [2024-10-11 07:00:20,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:18" (2/3) ... [2024-10-11 07:00:20,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15755cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:00:20, skipping insertion in model container [2024-10-11 07:00:20,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:00:20" (3/3) ... [2024-10-11 07:00:20,120 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2024-10-11 07:00:20,138 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:00:20,139 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:00:20,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:00:20,208 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;@4ce981d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:00:20,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:00:20,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 114 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:20,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 07:00:20,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:00:20,224 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:00:20,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:00:20,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:00:20,231 INFO L85 PathProgramCache]: Analyzing trace with hash 148223317, now seen corresponding path program 1 times [2024-10-11 07:00:20,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:00:20,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362071755] [2024-10-11 07:00:20,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:00:20,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:00:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:00:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:00:20,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:00:20,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362071755] [2024-10-11 07:00:20,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362071755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:00:20,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:00:20,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:00:20,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261336934] [2024-10-11 07:00:20,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:00:20,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:00:20,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:00:20,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:00:20,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:00:20,967 INFO L87 Difference]: Start difference. First operand has 115 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 114 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:00:21,033 INFO L93 Difference]: Finished difference Result 190 states and 282 transitions. [2024-10-11 07:00:21,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:00:21,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-11 07:00:21,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:00:21,046 INFO L225 Difference]: With dead ends: 190 [2024-10-11 07:00:21,047 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 07:00:21,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:00:21,056 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:00:21,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 490 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:00:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 07:00:21,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-11 07:00:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.4782608695652173) internal successors, (170), 115 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2024-10-11 07:00:21,099 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 38 [2024-10-11 07:00:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:00:21,100 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2024-10-11 07:00:21,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2024-10-11 07:00:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 07:00:21,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:00:21,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:00:21,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:00:21,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:00:21,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:00:21,103 INFO L85 PathProgramCache]: Analyzing trace with hash 301650905, now seen corresponding path program 1 times [2024-10-11 07:00:21,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:00:21,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617200772] [2024-10-11 07:00:21,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:00:21,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:00:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:00:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:00:21,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:00:21,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617200772] [2024-10-11 07:00:21,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617200772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:00:21,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:00:21,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:00:21,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761204813] [2024-10-11 07:00:21,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:00:21,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:00:21,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:00:21,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:00:21,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:00:21,347 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:00:21,394 INFO L93 Difference]: Finished difference Result 193 states and 282 transitions. [2024-10-11 07:00:21,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:00:21,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-11 07:00:21,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:00:21,397 INFO L225 Difference]: With dead ends: 193 [2024-10-11 07:00:21,397 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 07:00:21,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:00:21,399 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:00:21,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:00:21,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 07:00:21,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-11 07:00:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.4700854700854702) internal successors, (172), 117 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-10-11 07:00:21,413 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 39 [2024-10-11 07:00:21,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:00:21,413 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-10-11 07:00:21,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-10-11 07:00:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 07:00:21,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:00:21,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:00:21,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:00:21,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:00:21,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:00:21,419 INFO L85 PathProgramCache]: Analyzing trace with hash -336722258, now seen corresponding path program 1 times [2024-10-11 07:00:21,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:00:21,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532342568] [2024-10-11 07:00:21,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:00:21,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:00:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:00:22,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:00:22,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:00:22,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532342568] [2024-10-11 07:00:22,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532342568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:00:22,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:00:22,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 07:00:22,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984189680] [2024-10-11 07:00:22,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:00:22,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:00:22,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:00:22,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:00:22,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:00:22,081 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:22,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:00:22,342 INFO L93 Difference]: Finished difference Result 272 states and 394 transitions. [2024-10-11 07:00:22,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:00:22,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-10-11 07:00:22,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:00:22,344 INFO L225 Difference]: With dead ends: 272 [2024-10-11 07:00:22,344 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 07:00:22,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:00:22,346 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 352 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:00:22,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 757 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:00:22,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 07:00:22,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 140. [2024-10-11 07:00:22,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.4676258992805755) internal successors, (204), 139 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 204 transitions. [2024-10-11 07:00:22,357 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 204 transitions. Word has length 40 [2024-10-11 07:00:22,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:00:22,357 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 204 transitions. [2024-10-11 07:00:22,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:22,358 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 204 transitions. [2024-10-11 07:00:22,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 07:00:22,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:00:22,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:00:22,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:00:22,359 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:00:22,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:00:22,360 INFO L85 PathProgramCache]: Analyzing trace with hash -283910084, now seen corresponding path program 1 times [2024-10-11 07:00:22,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:00:22,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224031922] [2024-10-11 07:00:22,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:00:22,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:00:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:00:22,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:00:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:00:22,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:00:22,492 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:00:22,493 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:00:22,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:00:22,498 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 07:00:22,554 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:00:22,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:00:22 BoogieIcfgContainer [2024-10-11 07:00:22,558 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:00:22,558 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:00:22,558 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:00:22,558 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:00:22,559 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:00:20" (3/4) ... [2024-10-11 07:00:22,563 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:00:22,565 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:00:22,565 INFO L158 Benchmark]: Toolchain (without parser) took 4364.21ms. Allocated memory was 153.1MB in the beginning and 209.7MB in the end (delta: 56.6MB). Free memory was 113.1MB in the beginning and 162.0MB in the end (delta: -48.9MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-10-11 07:00:22,566 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:00:22,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.47ms. Allocated memory is still 153.1MB. Free memory was 112.5MB in the beginning and 91.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 07:00:22,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.74ms. Allocated memory is still 153.1MB. Free memory was 91.5MB in the beginning and 79.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 07:00:22,567 INFO L158 Benchmark]: Boogie Preprocessor took 160.70ms. Allocated memory is still 153.1MB. Free memory was 79.5MB in the beginning and 70.5MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 07:00:22,567 INFO L158 Benchmark]: RCFGBuilder took 1102.11ms. Allocated memory is still 153.1MB. Free memory was 70.5MB in the beginning and 74.9MB in the end (delta: -4.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-11 07:00:22,568 INFO L158 Benchmark]: TraceAbstraction took 2446.60ms. Allocated memory was 153.1MB in the beginning and 209.7MB in the end (delta: 56.6MB). Free memory was 74.3MB in the beginning and 162.0MB in the end (delta: -87.7MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2024-10-11 07:00:22,568 INFO L158 Benchmark]: Witness Printer took 6.45ms. Allocated memory is still 209.7MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:00:22,574 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 548.47ms. Allocated memory is still 153.1MB. Free memory was 112.5MB in the beginning and 91.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.74ms. Allocated memory is still 153.1MB. Free memory was 91.5MB in the beginning and 79.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 160.70ms. Allocated memory is still 153.1MB. Free memory was 79.5MB in the beginning and 70.5MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1102.11ms. Allocated memory is still 153.1MB. Free memory was 70.5MB in the beginning and 74.9MB in the end (delta: -4.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2446.60ms. Allocated memory was 153.1MB in the beginning and 209.7MB in the end (delta: 56.6MB). Free memory was 74.3MB in the beginning and 162.0MB in the end (delta: -87.7MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * Witness Printer took 6.45ms. Allocated memory is still 209.7MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 149. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 32); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (32 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 2); [L33] const SORT_16 msb_SORT_16 = (SORT_16)1 << (2 - 1); [L35] const SORT_59 mask_SORT_59 = (SORT_59)-1 >> (sizeof(SORT_59) * 8 - 3); [L36] const SORT_59 msb_SORT_59 = (SORT_59)1 << (3 - 1); [L38] const SORT_16 var_17 = 0; [L39] const SORT_16 var_20 = 3; [L40] const SORT_3 var_22 = 1; [L41] const SORT_3 var_36 = 0; [L42] const SORT_16 var_77 = 2; [L43] const SORT_16 var_80 = 1; [L44] const SORT_59 var_92 = 0; [L46] SORT_1 input_2; [L47] SORT_3 input_4; [L48] SORT_1 input_5; [L49] SORT_3 input_6; [L50] SORT_3 input_7; [L51] SORT_3 input_8; [L52] SORT_1 input_9; [L53] SORT_3 input_10; [L54] SORT_3 input_11; [L55] SORT_1 input_12; [L56] SORT_3 input_13; [L57] SORT_3 input_14; [L58] SORT_3 input_15; [L59] SORT_1 input_32; [L60] SORT_3 input_34; [L61] SORT_1 input_39; [L62] SORT_3 input_41; [L63] SORT_1 input_47; [L64] SORT_1 input_53; [L65] SORT_1 input_55; [L66] SORT_1 input_57; [L67] SORT_59 input_60; [L68] SORT_59 input_66; [L69] SORT_1 input_69; [L70] SORT_3 input_73; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_16 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L72] SORT_16 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_16; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L73] SORT_3 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L74] SORT_3 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L75] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L76] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L77] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L78] SORT_3 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L79] SORT_3 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L80] SORT_3 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L81] SORT_3 state_71 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L83] SORT_16 init_19_arg_1 = var_17; [L84] state_18 = init_19_arg_1 [L85] SORT_3 init_24_arg_1 = var_22; [L86] state_23 = init_24_arg_1 [L87] SORT_3 init_38_arg_1 = var_36; [L88] state_37 = init_38_arg_1 [L89] SORT_3 init_44_arg_1 = var_36; [L90] state_43 = init_44_arg_1 [L91] SORT_3 init_46_arg_1 = var_36; [L92] state_45 = init_46_arg_1 [L93] SORT_3 init_50_arg_1 = var_36; [L94] state_49 = init_50_arg_1 [L95] SORT_3 init_52_arg_1 = var_36; [L96] state_51 = init_52_arg_1 [L97] SORT_3 init_63_arg_1 = var_36; [L98] state_62 = init_63_arg_1 [L99] SORT_3 init_65_arg_1 = var_36; [L100] state_64 = init_65_arg_1 [L101] SORT_3 init_72_arg_1 = var_36; [L102] state_71 = init_72_arg_1 VAL [mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L105] input_2 = __VERIFIER_nondet_uint() [L106] input_4 = __VERIFIER_nondet_uchar() [L107] input_5 = __VERIFIER_nondet_uint() [L108] input_6 = __VERIFIER_nondet_uchar() [L109] input_7 = __VERIFIER_nondet_uchar() [L110] EXPR input_7 & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L110] input_7 = input_7 & mask_SORT_3 [L111] input_8 = __VERIFIER_nondet_uchar() [L112] EXPR input_8 & mask_SORT_3 VAL [input_7=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L112] input_8 = input_8 & mask_SORT_3 [L113] input_9 = __VERIFIER_nondet_uint() [L114] input_10 = __VERIFIER_nondet_uchar() [L115] EXPR input_10 & mask_SORT_3 VAL [input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L115] input_10 = input_10 & mask_SORT_3 [L116] input_11 = __VERIFIER_nondet_uchar() [L117] EXPR input_11 & mask_SORT_3 VAL [input_10=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L117] input_11 = input_11 & mask_SORT_3 [L118] input_12 = __VERIFIER_nondet_uint() [L119] input_13 = __VERIFIER_nondet_uchar() [L120] input_14 = __VERIFIER_nondet_uchar() [L121] input_15 = __VERIFIER_nondet_uchar() [L122] input_32 = __VERIFIER_nondet_uint() [L123] input_34 = __VERIFIER_nondet_uchar() [L124] input_39 = __VERIFIER_nondet_uint() [L125] input_41 = __VERIFIER_nondet_uchar() [L126] input_47 = __VERIFIER_nondet_uint() [L127] input_53 = __VERIFIER_nondet_uint() [L128] input_55 = __VERIFIER_nondet_uint() [L129] input_57 = __VERIFIER_nondet_uint() [L130] input_60 = __VERIFIER_nondet_uchar() [L131] input_66 = __VERIFIER_nondet_uchar() [L132] input_69 = __VERIFIER_nondet_uint() [L133] input_73 = __VERIFIER_nondet_uchar() [L136] SORT_16 var_21_arg_0 = state_18; [L137] SORT_16 var_21_arg_1 = var_20; [L138] SORT_3 var_21 = var_21_arg_0 != var_21_arg_1; [L139] SORT_3 var_25_arg_0 = state_23; [L140] SORT_3 var_25_arg_1 = var_22; [L141] SORT_3 var_25 = var_25_arg_0 == var_25_arg_1; [L142] SORT_3 var_26_arg_0 = var_21; [L143] SORT_3 var_26_arg_1 = var_25; VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_26_arg_0=1, var_26_arg_1=1, var_36=0, var_77=2, var_80=1, var_92=0] [L144] EXPR var_26_arg_0 | var_26_arg_1 VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L144] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L145] SORT_3 var_29_arg_0 = var_26; [L146] SORT_3 var_29 = ~var_29_arg_0; [L147] SORT_3 var_30_arg_0 = var_22; [L148] SORT_3 var_30_arg_1 = var_29; VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_30_arg_0=1, var_30_arg_1=-2, var_36=0, var_77=2, var_80=1, var_92=0] [L149] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L149] SORT_3 var_30 = var_30_arg_0 & var_30_arg_1; [L150] EXPR var_30 & mask_SORT_3 VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L150] var_30 = var_30 & mask_SORT_3 [L151] SORT_3 bad_31_arg_0 = var_30; [L152] CALL __VERIFIER_assert(!(bad_31_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 352 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 352 mSDsluCounter, 1734 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1253 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 481 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 55 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 430 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 07:00:22,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1ef8d174762b17df623a48d7afe94f1e8bc5e2233dcaad9b42847f8ac912d010 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:00:24,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:00:25,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 07:00:25,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:00:25,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:00:25,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:00:25,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:00:25,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:00:25,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:00:25,076 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:00:25,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:00:25,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:00:25,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:00:25,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:00:25,078 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:00:25,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:00:25,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:00:25,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:00:25,079 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:00:25,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:00:25,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:00:25,081 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:00:25,082 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:00:25,082 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:00:25,082 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:00:25,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:00:25,082 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:00:25,083 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:00:25,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:00:25,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:00:25,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:00:25,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:00:25,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:00:25,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:00:25,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:00:25,091 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:00:25,091 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:00:25,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:00:25,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:00:25,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:00:25,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:00:25,092 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:00:25,092 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-clean/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-clean/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 -> 1ef8d174762b17df623a48d7afe94f1e8bc5e2233dcaad9b42847f8ac912d010 [2024-10-11 07:00:25,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:00:25,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:00:25,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:00:25,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:00:25,460 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:00:25,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2024-10-11 07:00:26,934 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:00:27,157 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:00:27,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2024-10-11 07:00:27,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bd7059468/e2845f687d3041cba309b52bac3c28dd/FLAG7699b608b [2024-10-11 07:00:27,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bd7059468/e2845f687d3041cba309b52bac3c28dd [2024-10-11 07:00:27,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:00:27,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:00:27,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:00:27,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:00:27,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:00:27,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:00:27" (1/1) ... [2024-10-11 07:00:27,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eb04281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:27, skipping insertion in model container [2024-10-11 07:00:27,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:00:27" (1/1) ... [2024-10-11 07:00:27,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:00:27,727 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c[1258,1271] [2024-10-11 07:00:27,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:00:27,873 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:00:27,886 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c[1258,1271] [2024-10-11 07:00:27,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:00:28,003 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:00:28,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:28 WrapperNode [2024-10-11 07:00:28,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:00:28,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:00:28,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:00:28,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:00:28,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:28" (1/1) ... [2024-10-11 07:00:28,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:28" (1/1) ... [2024-10-11 07:00:28,083 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 402 [2024-10-11 07:00:28,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:00:28,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:00:28,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:00:28,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:00:28,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:28" (1/1) ... [2024-10-11 07:00:28,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:28" (1/1) ... [2024-10-11 07:00:28,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:28" (1/1) ... [2024-10-11 07:00:28,140 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:00:28,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:28" (1/1) ... [2024-10-11 07:00:28,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:28" (1/1) ... [2024-10-11 07:00:28,164 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:28" (1/1) ... [2024-10-11 07:00:28,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:28" (1/1) ... [2024-10-11 07:00:28,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:28" (1/1) ... [2024-10-11 07:00:28,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:28" (1/1) ... [2024-10-11 07:00:28,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:00:28,192 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:00:28,192 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:00:28,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:00:28,197 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:28" (1/1) ... [2024-10-11 07:00:28,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:00:28,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:00:28,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:00:28,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:00:28,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:00:28,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:00:28,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:00:28,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:00:28,457 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:00:28,459 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:00:28,864 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-11 07:00:28,866 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:00:28,905 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:00:28,906 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:00:28,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:00:28 BoogieIcfgContainer [2024-10-11 07:00:28,906 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:00:28,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:00:28,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:00:28,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:00:28,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:00:27" (1/3) ... [2024-10-11 07:00:28,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea30b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:00:28, skipping insertion in model container [2024-10-11 07:00:28,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:00:28" (2/3) ... [2024-10-11 07:00:28,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea30b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:00:28, skipping insertion in model container [2024-10-11 07:00:28,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:00:28" (3/3) ... [2024-10-11 07:00:28,917 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2024-10-11 07:00:28,933 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:00:28,934 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:00:29,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:00:29,008 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;@2fdfe975, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:00:29,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:00:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 07:00:29,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:00:29,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 07:00:29,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:00:29,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:00:29,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 07:00:29,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:00:29,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324299071] [2024-10-11 07:00:29,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:00:29,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:00:29,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:00:29,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:00:29,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 07:00:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:00:29,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 07:00:29,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:00:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:00:29,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:00:29,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:00:29,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324299071] [2024-10-11 07:00:29,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324299071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:00:29,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:00:29,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:00:29,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840426883] [2024-10-11 07:00:29,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:00:29,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:00:29,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:00:29,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:00:29,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:00:29,476 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:29,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:00:29,541 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 07:00:29,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:00:29,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 07:00:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:00:29,562 INFO L225 Difference]: With dead ends: 15 [2024-10-11 07:00:29,562 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 07:00:29,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:00:29,573 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:00:29,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:00:29,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 07:00:29,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 07:00:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 07:00:29,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 07:00:29,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:00:29,609 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 07:00:29,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:29,610 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 07:00:29,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 07:00:29,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:00:29,610 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 07:00:29,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 07:00:29,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:00:29,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:00:29,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:00:29,815 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 07:00:29,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:00:29,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833291174] [2024-10-11 07:00:29,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:00:29,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:00:29,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:00:29,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:00:29,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 07:00:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:00:29,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 07:00:30,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:00:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:00:30,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:00:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:00:32,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:00:32,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833291174] [2024-10-11 07:00:32,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833291174] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:00:32,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:00:32,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 07:00:32,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400578478] [2024-10-11 07:00:32,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:00:32,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:00:32,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:00:32,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:00:32,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:00:32,938 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:00:33,014 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-11 07:00:33,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:00:33,015 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 07:00:33,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:00:33,015 INFO L225 Difference]: With dead ends: 14 [2024-10-11 07:00:33,015 INFO L226 Difference]: Without dead ends: 12 [2024-10-11 07:00:33,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:00:33,017 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:00:33,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:00:33,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-11 07:00:33,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-11 07:00:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-11 07:00:33,020 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-11 07:00:33,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:00:33,020 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-11 07:00:33,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:33,021 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-11 07:00:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 07:00:33,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:00:33,021 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-11 07:00:33,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 07:00:33,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:00:33,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:00:33,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:00:33,224 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-11 07:00:33,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:00:33,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095920332] [2024-10-11 07:00:33,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 07:00:33,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:00:33,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:00:33,229 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:00:33,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 07:00:33,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 07:00:33,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 07:00:33,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 07:00:33,423 INFO L278 TraceCheckSpWp]: Computing forward predicates...