./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b6dd2ed6c1bce1a10f9a63c051c029a066fa5b3cc478546a4f140edcb3bcb50c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:42:39,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:42:39,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:42:39,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:42:39,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:42:39,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:42:39,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:42:39,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:42:39,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:42:39,921 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:42:39,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:42:39,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:42:39,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:42:39,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:42:39,923 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:42:39,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:42:39,924 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:42:39,924 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:42:39,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:42:39,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:42:39,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:42:39,925 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:42:39,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:42:39,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:42:39,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:42:39,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:42:39,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:42:39,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:42:39,927 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:42:39,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:42:39,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:42:39,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:42:39,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:42:39,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:42:39,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:42:39,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:42:39,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:42:39,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:42:39,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:42:39,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:42:39,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:42:39,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:42:39,929 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6dd2ed6c1bce1a10f9a63c051c029a066fa5b3cc478546a4f140edcb3bcb50c [2024-11-22 10:42:40,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:42:40,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:42:40,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:42:40,177 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:42:40,178 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:42:40,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i [2024-11-22 10:42:41,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:42:41,706 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:42:41,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i [2024-11-22 10:42:41,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16db130ea/8e43f575a66245e69ed14cf32664588f/FLAG3879ec3bf [2024-11-22 10:42:41,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16db130ea/8e43f575a66245e69ed14cf32664588f [2024-11-22 10:42:41,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:42:41,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:42:41,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:42:41,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:42:41,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:42:41,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:42:41" (1/1) ... [2024-11-22 10:42:41,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd21caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:41, skipping insertion in model container [2024-11-22 10:42:41,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:42:41" (1/1) ... [2024-11-22 10:42:41,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:42:41,925 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i[915,928] [2024-11-22 10:42:41,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:42:41,970 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:42:41,979 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i[915,928] [2024-11-22 10:42:41,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:42:42,011 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:42:42,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:42 WrapperNode [2024-11-22 10:42:42,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:42:42,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:42:42,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:42:42,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:42:42,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:42" (1/1) ... [2024-11-22 10:42:42,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:42" (1/1) ... [2024-11-22 10:42:42,066 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-22 10:42:42,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:42:42,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:42:42,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:42:42,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:42:42,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:42" (1/1) ... [2024-11-22 10:42:42,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:42" (1/1) ... [2024-11-22 10:42:42,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:42" (1/1) ... [2024-11-22 10:42:42,107 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 10:42:42,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:42" (1/1) ... [2024-11-22 10:42:42,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:42" (1/1) ... [2024-11-22 10:42:42,118 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:42" (1/1) ... [2024-11-22 10:42:42,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:42" (1/1) ... [2024-11-22 10:42:42,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:42" (1/1) ... [2024-11-22 10:42:42,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:42" (1/1) ... [2024-11-22 10:42:42,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:42:42,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:42:42,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:42:42,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:42:42,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:42" (1/1) ... [2024-11-22 10:42:42,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:42:42,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:42:42,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 10:42:42,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 10:42:42,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:42:42,213 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:42:42,213 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:42:42,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:42:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:42:42,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:42:42,283 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:42:42,285 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:42:42,588 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-22 10:42:42,588 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:42:42,602 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:42:42,603 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:42:42,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:42:42 BoogieIcfgContainer [2024-11-22 10:42:42,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:42:42,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:42:42,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:42:42,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:42:42,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:42:41" (1/3) ... [2024-11-22 10:42:42,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f84051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:42:42, skipping insertion in model container [2024-11-22 10:42:42,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:42" (2/3) ... [2024-11-22 10:42:42,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f84051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:42:42, skipping insertion in model container [2024-11-22 10:42:42,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:42:42" (3/3) ... [2024-11-22 10:42:42,614 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-64.i [2024-11-22 10:42:42,628 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:42:42,628 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:42:42,679 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:42:42,684 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;@121ae13c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:42:42,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:42:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 10:42:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-22 10:42:42,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:42:42,701 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:42:42,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:42:42,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:42:42,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1172374836, now seen corresponding path program 1 times [2024-11-22 10:42:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:42:42,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527958076] [2024-11-22 10:42:42,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:42:42,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:42:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:42:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-22 10:42:42,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:42:42,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527958076] [2024-11-22 10:42:42,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527958076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:42:42,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656980293] [2024-11-22 10:42:42,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:42:42,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:42:42,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:42:42,953 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:42:42,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 10:42:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:42:43,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:42:43,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:42:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-22 10:42:43,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:42:43,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656980293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:42:43,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:42:43,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:42:43,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762072227] [2024-11-22 10:42:43,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:42:43,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:42:43,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:42:43,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:42:43,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:42:43,125 INFO L87 Difference]: Start difference. First operand has 55 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 10:42:43,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:42:43,143 INFO L93 Difference]: Finished difference Result 105 states and 165 transitions. [2024-11-22 10:42:43,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:42:43,145 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2024-11-22 10:42:43,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:42:43,152 INFO L225 Difference]: With dead ends: 105 [2024-11-22 10:42:43,152 INFO L226 Difference]: Without dead ends: 49 [2024-11-22 10:42:43,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:42:43,160 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:42:43,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:42:43,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-22 10:42:43,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-22 10:42:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 10:42:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 68 transitions. [2024-11-22 10:42:43,199 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 68 transitions. Word has length 82 [2024-11-22 10:42:43,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:42:43,200 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 68 transitions. [2024-11-22 10:42:43,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 10:42:43,201 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2024-11-22 10:42:43,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-22 10:42:43,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:42:43,205 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:42:43,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 10:42:43,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 10:42:43,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:42:43,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:42:43,411 INFO L85 PathProgramCache]: Analyzing trace with hash 563923636, now seen corresponding path program 1 times [2024-11-22 10:42:43,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:42:43,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261664725] [2024-11-22 10:42:43,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:42:43,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:42:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:42:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 10:42:44,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:42:44,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261664725] [2024-11-22 10:42:44,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261664725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:42:44,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:42:44,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 10:42:44,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782523104] [2024-11-22 10:42:44,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:42:44,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 10:42:44,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:42:44,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 10:42:44,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:42:44,050 INFO L87 Difference]: Start difference. First operand 49 states and 68 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 10:42:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:42:44,332 INFO L93 Difference]: Finished difference Result 156 states and 219 transitions. [2024-11-22 10:42:44,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 10:42:44,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-11-22 10:42:44,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:42:44,335 INFO L225 Difference]: With dead ends: 156 [2024-11-22 10:42:44,335 INFO L226 Difference]: Without dead ends: 110 [2024-11-22 10:42:44,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:42:44,338 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 140 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:42:44,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 199 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:42:44,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-22 10:42:44,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 79. [2024-11-22 10:42:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 55 states have internal predecessors, (68), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-22 10:42:44,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 112 transitions. [2024-11-22 10:42:44,365 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 112 transitions. Word has length 82 [2024-11-22 10:42:44,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:42:44,366 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 112 transitions. [2024-11-22 10:42:44,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 10:42:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 112 transitions. [2024-11-22 10:42:44,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-22 10:42:44,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:42:44,368 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:42:44,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:42:44,368 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:42:44,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:42:44,369 INFO L85 PathProgramCache]: Analyzing trace with hash 903953327, now seen corresponding path program 1 times [2024-11-22 10:42:44,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:42:44,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592780298] [2024-11-22 10:42:44,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:42:44,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:42:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 10:42:44,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1715167766] [2024-11-22 10:42:44,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:42:44,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:42:44,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:42:44,435 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:42:44,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 10:42:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:42:44,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 10:42:44,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:42:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 10:42:44,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:42:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 10:42:45,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:42:45,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592780298] [2024-11-22 10:42:45,005 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 10:42:45,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715167766] [2024-11-22 10:42:45,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715167766] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 10:42:45,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:42:45,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-22 10:42:45,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712587134] [2024-11-22 10:42:45,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:42:45,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 10:42:45,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:42:45,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 10:42:45,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:42:45,008 INFO L87 Difference]: Start difference. First operand 79 states and 112 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 10:42:45,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:42:45,240 INFO L93 Difference]: Finished difference Result 150 states and 206 transitions. [2024-11-22 10:42:45,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 10:42:45,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-11-22 10:42:45,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:42:45,246 INFO L225 Difference]: With dead ends: 150 [2024-11-22 10:42:45,246 INFO L226 Difference]: Without dead ends: 90 [2024-11-22 10:42:45,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:42:45,247 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:42:45,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 149 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:42:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-22 10:42:45,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2024-11-22 10:42:45,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 55 states have internal predecessors, (67), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-22 10:42:45,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 111 transitions. [2024-11-22 10:42:45,258 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 111 transitions. Word has length 83 [2024-11-22 10:42:45,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:42:45,259 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 111 transitions. [2024-11-22 10:42:45,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 10:42:45,259 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 111 transitions. [2024-11-22 10:42:45,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-22 10:42:45,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:42:45,261 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:42:45,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 10:42:45,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-22 10:42:45,462 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:42:45,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:42:45,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1616006607, now seen corresponding path program 1 times [2024-11-22 10:42:45,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:42:45,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166227839] [2024-11-22 10:42:45,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:42:45,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:42:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 10:42:45,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1477236649] [2024-11-22 10:42:45,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:42:45,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:42:45,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:42:45,491 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:42:45,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 10:42:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:42:45,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 10:42:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:42:45,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 10:42:45,619 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 10:42:45,620 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 10:42:45,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 10:42:45,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:42:45,825 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-22 10:42:45,891 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 10:42:45,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:42:45 BoogieIcfgContainer [2024-11-22 10:42:45,895 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 10:42:45,896 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 10:42:45,896 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 10:42:45,896 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 10:42:45,896 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:42:42" (3/4) ... [2024-11-22 10:42:45,899 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 10:42:45,900 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 10:42:45,901 INFO L158 Benchmark]: Toolchain (without parser) took 4153.68ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 118.8MB in the beginning and 92.4MB in the end (delta: 26.4MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. [2024-11-22 10:42:45,902 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 176.2MB. Free memory is still 143.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:42:45,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.41ms. Allocated memory is still 176.2MB. Free memory was 118.5MB in the beginning and 104.5MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 10:42:45,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.30ms. Allocated memory is still 176.2MB. Free memory was 104.5MB in the beginning and 101.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 10:42:45,903 INFO L158 Benchmark]: Boogie Preprocessor took 66.87ms. Allocated memory is still 176.2MB. Free memory was 101.0MB in the beginning and 97.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:42:45,904 INFO L158 Benchmark]: RCFGBuilder took 469.27ms. Allocated memory is still 176.2MB. Free memory was 97.5MB in the beginning and 78.3MB in the end (delta: 19.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-22 10:42:45,904 INFO L158 Benchmark]: TraceAbstraction took 3289.21ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 77.6MB in the beginning and 92.4MB in the end (delta: -14.8MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2024-11-22 10:42:45,904 INFO L158 Benchmark]: Witness Printer took 5.28ms. Allocated memory is still 232.8MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:42:45,905 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.24ms. Allocated memory is still 176.2MB. Free memory is still 143.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.41ms. Allocated memory is still 176.2MB. Free memory was 118.5MB in the beginning and 104.5MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.30ms. Allocated memory is still 176.2MB. Free memory was 104.5MB in the beginning and 101.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.87ms. Allocated memory is still 176.2MB. Free memory was 101.0MB in the beginning and 97.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 469.27ms. Allocated memory is still 176.2MB. Free memory was 97.5MB in the beginning and 78.3MB in the end (delta: 19.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3289.21ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 77.6MB in the beginning and 92.4MB in the end (delta: -14.8MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * Witness Printer took 5.28ms. Allocated memory is still 232.8MB. Free memory is still 92.4MB. 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: 19]: 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 someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 0.9; [L23] unsigned long int var_1_3 = 2941876006; [L24] double var_1_5 = 127.422; [L25] unsigned short int var_1_6 = 10; [L26] unsigned char var_1_7 = 1; [L27] unsigned long int var_1_9 = 4; [L28] unsigned short int var_1_11 = 44699; [L29] signed short int var_1_13 = 2; [L30] unsigned char var_1_15 = 0; [L31] unsigned char var_1_16 = 16; [L32] float var_1_17 = 8.125; VAL [isInitial=0, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2941876006, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L86] isInitial = 1 [L87] FCALL initially() [L88] int k_loop; [L89] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2941876006, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L89] COND TRUE k_loop < 1 [L90] FCALL updateLastVariables() [L91] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_ulong() [L61] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L61] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L62] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L62] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L63] var_1_5 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=1, var_1_9=4] [L64] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=1, var_1_9=4] [L65] var_1_7 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_9=4] [L66] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_9=4] [L67] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=4] [L67] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=4] [L68] var_1_9 = __VERIFIER_nondet_ulong() [L69] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0] [L69] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0] [L70] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0] [L70] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0] [L71] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L71] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L72] var_1_11 = __VERIFIER_nondet_ushort() [L73] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L73] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L74] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L74] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L75] var_1_16 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L76] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L77] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L91] RET updateVariables() [L92] CALL step() [L36] var_1_15 = var_1_16 [L37] var_1_17 = var_1_5 VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=-2147483649, var_1_5=2, var_1_6=10, var_1_7=0, var_1_9=1] [L38] EXPR var_1_15 & var_1_15 VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=-2147483649, var_1_5=2, var_1_6=10, var_1_7=0, var_1_9=1] [L38] unsigned long int stepLocal_2 = var_1_3 * (var_1_15 & var_1_15); [L39] COND FALSE !(\read(var_1_7)) [L46] var_1_6 = (((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) + 1) VAL [isInitial=1, stepLocal_2=0, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=-2147483649, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L48] var_1_13 = var_1_15 [L49] signed long int stepLocal_1 = var_1_6 * var_1_15; [L50] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=-2147483649, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L51] COND TRUE stepLocal_0 <= (var_1_3 - var_1_6) VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=-2147483649, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L52] COND FALSE !(var_1_3 < stepLocal_1) [L55] var_1_1 = var_1_5 VAL [isInitial=1, stepLocal_2=0, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=-2147483649, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L92] RET step() [L93] CALL, EXPR property() [L82] EXPR ((var_1_15 <= (var_1_3 - var_1_6)) ? ((var_1_3 < (var_1_6 * var_1_15)) ? (var_1_1 == ((double) var_1_5)) : (var_1_1 == ((double) var_1_5))) : 1) && (var_1_7 ? (((var_1_3 * (var_1_15 & var_1_15)) <= (var_1_15 / var_1_9)) ? (var_1_6 == ((unsigned short int) (47342 - var_1_15))) : (var_1_6 == ((unsigned short int) (var_1_11 - ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))))) : (var_1_6 == ((unsigned short int) (((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) + 1)))) VAL [isInitial=1, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=-2147483649, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L82-L83] return (((((var_1_15 <= (var_1_3 - var_1_6)) ? ((var_1_3 < (var_1_6 * var_1_15)) ? (var_1_1 == ((double) var_1_5)) : (var_1_1 == ((double) var_1_5))) : 1) && (var_1_7 ? (((var_1_3 * (var_1_15 & var_1_15)) <= (var_1_15 / var_1_9)) ? (var_1_6 == ((unsigned short int) (47342 - var_1_15))) : (var_1_6 == ((unsigned short int) (var_1_11 - ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))))) : (var_1_6 == ((unsigned short int) (((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) + 1))))) && (var_1_13 == ((signed short int) var_1_15))) && (var_1_15 == ((unsigned char) var_1_16))) && (var_1_17 == ((float) var_1_5)) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=-2147483649, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=-2147483649, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 164 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 420 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 209 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 211 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 42 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 578 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 407 ConstructedInterpolants, 3 QuantifiedInterpolants, 871 SizeOfPredicates, 4 NumberOfNonLiveVariables, 403 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1265/1320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 10:42:45,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b6dd2ed6c1bce1a10f9a63c051c029a066fa5b3cc478546a4f140edcb3bcb50c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:42:47,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:42:48,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 10:42:48,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:42:48,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:42:48,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:42:48,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:42:48,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:42:48,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:42:48,052 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:42:48,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:42:48,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:42:48,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:42:48,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:42:48,054 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:42:48,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:42:48,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:42:48,056 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:42:48,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:42:48,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:42:48,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:42:48,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:42:48,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:42:48,060 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 10:42:48,060 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 10:42:48,060 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:42:48,060 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 10:42:48,060 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:42:48,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:42:48,061 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:42:48,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:42:48,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:42:48,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:42:48,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:42:48,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:42:48,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:42:48,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:42:48,062 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:42:48,062 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 10:42:48,062 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 10:42:48,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:42:48,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:42:48,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:42:48,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:42:48,064 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6dd2ed6c1bce1a10f9a63c051c029a066fa5b3cc478546a4f140edcb3bcb50c [2024-11-22 10:42:48,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:42:48,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:42:48,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:42:48,362 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:42:48,362 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:42:48,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i [2024-11-22 10:42:49,873 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:42:50,114 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:42:50,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i [2024-11-22 10:42:50,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8683beb5/9920e1ff3f5142c0837d9686f8e91609/FLAGad788fbfe [2024-11-22 10:42:50,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8683beb5/9920e1ff3f5142c0837d9686f8e91609 [2024-11-22 10:42:50,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:42:50,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:42:50,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:42:50,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:42:50,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:42:50,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:42:50" (1/1) ... [2024-11-22 10:42:50,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e9705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:50, skipping insertion in model container [2024-11-22 10:42:50,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:42:50" (1/1) ... [2024-11-22 10:42:50,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:42:50,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i[915,928] [2024-11-22 10:42:50,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:42:50,475 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:42:50,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i[915,928] [2024-11-22 10:42:50,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:42:50,527 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:42:50,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:50 WrapperNode [2024-11-22 10:42:50,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:42:50,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:42:50,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:42:50,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:42:50,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:50" (1/1) ... [2024-11-22 10:42:50,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:50" (1/1) ... [2024-11-22 10:42:50,569 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2024-11-22 10:42:50,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:42:50,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:42:50,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:42:50,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:42:50,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:50" (1/1) ... [2024-11-22 10:42:50,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:50" (1/1) ... [2024-11-22 10:42:50,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:50" (1/1) ... [2024-11-22 10:42:50,598 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 10:42:50,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:50" (1/1) ... [2024-11-22 10:42:50,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:50" (1/1) ... [2024-11-22 10:42:50,612 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:50" (1/1) ... [2024-11-22 10:42:50,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:50" (1/1) ... [2024-11-22 10:42:50,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:50" (1/1) ... [2024-11-22 10:42:50,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:50" (1/1) ... [2024-11-22 10:42:50,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:42:50,631 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:42:50,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:42:50,632 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:42:50,633 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:50" (1/1) ... [2024-11-22 10:42:50,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:42:50,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:42:50,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 10:42:50,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 10:42:50,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:42:50,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 10:42:50,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:42:50,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:42:50,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:42:50,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:42:50,775 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:42:50,778 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:42:51,306 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-22 10:42:51,306 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:42:51,318 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:42:51,318 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:42:51,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:42:51 BoogieIcfgContainer [2024-11-22 10:42:51,319 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:42:51,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:42:51,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:42:51,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:42:51,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:42:50" (1/3) ... [2024-11-22 10:42:51,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b839045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:42:51, skipping insertion in model container [2024-11-22 10:42:51,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:42:50" (2/3) ... [2024-11-22 10:42:51,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b839045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:42:51, skipping insertion in model container [2024-11-22 10:42:51,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:42:51" (3/3) ... [2024-11-22 10:42:51,329 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-64.i [2024-11-22 10:42:51,344 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:42:51,344 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:42:51,403 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:42:51,408 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;@359bb6ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:42:51,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:42:51,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 10:42:51,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-22 10:42:51,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:42:51,421 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:42:51,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:42:51,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:42:51,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1005874552, now seen corresponding path program 1 times [2024-11-22 10:42:51,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:42:51,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310162770] [2024-11-22 10:42:51,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:42:51,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:42:51,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:42:51,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:42:51,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 10:42:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:42:51,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:42:51,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:42:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-22 10:42:51,657 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:42:51,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:42:51,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310162770] [2024-11-22 10:42:51,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310162770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:42:51,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:42:51,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 10:42:51,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806583883] [2024-11-22 10:42:51,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:42:51,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:42:51,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:42:51,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:42:51,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:42:51,681 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 10:42:51,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:42:51,706 INFO L93 Difference]: Finished difference Result 83 states and 131 transitions. [2024-11-22 10:42:51,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:42:51,708 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2024-11-22 10:42:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:42:51,715 INFO L225 Difference]: With dead ends: 83 [2024-11-22 10:42:51,716 INFO L226 Difference]: Without dead ends: 39 [2024-11-22 10:42:51,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:42:51,722 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:42:51,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:42:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-22 10:42:51,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-22 10:42:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 10:42:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2024-11-22 10:42:51,761 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 78 [2024-11-22 10:42:51,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:42:51,762 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2024-11-22 10:42:51,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 10:42:51,764 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2024-11-22 10:42:51,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-22 10:42:51,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:42:51,768 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:42:51,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 10:42:51,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:42:51,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:42:51,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:42:51,971 INFO L85 PathProgramCache]: Analyzing trace with hash 191820536, now seen corresponding path program 1 times [2024-11-22 10:42:51,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:42:51,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282453220] [2024-11-22 10:42:51,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:42:51,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:42:51,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:42:51,981 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:42:51,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 10:42:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:42:52,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 10:42:52,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:42:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 10:42:52,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:42:52,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:42:52,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282453220] [2024-11-22 10:42:52,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282453220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:42:52,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1413084364] [2024-11-22 10:42:52,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:42:52,509 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 10:42:52,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 10:42:52,512 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 10:42:52,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-22 10:42:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:42:53,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 10:42:53,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:42:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 10:42:53,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:42:53,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1413084364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:42:53,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 10:42:53,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-22 10:42:53,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853478116] [2024-11-22 10:42:53,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 10:42:53,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 10:42:53,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:42:53,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 10:42:53,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-22 10:42:53,277 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 10:42:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:42:54,077 INFO L93 Difference]: Finished difference Result 93 states and 124 transitions. [2024-11-22 10:42:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:42:54,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2024-11-22 10:42:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:42:54,087 INFO L225 Difference]: With dead ends: 93 [2024-11-22 10:42:54,087 INFO L226 Difference]: Without dead ends: 57 [2024-11-22 10:42:54,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:42:54,088 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 42 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 10:42:54,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 93 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 10:42:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-22 10:42:54,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2024-11-22 10:42:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 10:42:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2024-11-22 10:42:54,100 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 78 [2024-11-22 10:42:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:42:54,100 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2024-11-22 10:42:54,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 10:42:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2024-11-22 10:42:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-22 10:42:54,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:42:54,102 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:42:54,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-11-22 10:42:54,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 10:42:54,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:42:54,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:42:54,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:42:54,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1415909004, now seen corresponding path program 1 times [2024-11-22 10:42:54,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:42:54,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947512485] [2024-11-22 10:42:54,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:42:54,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:42:54,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:42:54,511 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:42:54,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 10:42:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:42:54,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 10:42:54,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:42:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 10:42:54,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:42:55,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:42:55,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947512485] [2024-11-22 10:42:55,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947512485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:42:55,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1220428777] [2024-11-22 10:42:55,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:42:55,091 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 10:42:55,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 10:42:55,092 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 10:42:55,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-22 10:42:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:42:55,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 10:42:55,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:42:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 10:42:55,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:42:55,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1220428777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:42:55,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 10:42:55,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-22 10:42:55,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925222161] [2024-11-22 10:42:55,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 10:42:55,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 10:42:55,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:42:55,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 10:42:55,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 10:42:55,716 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 10:42:57,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:42:57,643 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2024-11-22 10:42:57,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:42:57,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-11-22 10:42:57,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:42:57,653 INFO L225 Difference]: With dead ends: 85 [2024-11-22 10:42:57,653 INFO L226 Difference]: Without dead ends: 45 [2024-11-22 10:42:57,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:42:57,654 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 15 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-22 10:42:57,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 103 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-22 10:42:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-22 10:42:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-11-22 10:42:57,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 10:42:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2024-11-22 10:42:57,660 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 79 [2024-11-22 10:42:57,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:42:57,660 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-11-22 10:42:57,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 10:42:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2024-11-22 10:42:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-22 10:42:57,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:42:57,661 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:42:57,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-22 10:42:57,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-22 10:42:58,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-22 10:42:58,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:42:58,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:42:58,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1417756046, now seen corresponding path program 1 times [2024-11-22 10:42:58,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:42:58,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870193028] [2024-11-22 10:42:58,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:42:58,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:42:58,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:42:58,068 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:42:58,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 10:42:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:42:58,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 10:42:58,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:43:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-22 10:43:18,834 INFO L311 TraceCheckSpWp]: Computing backward predicates...