./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-95.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 a15fad4ccd42e8290eb3eb8205bce76f0021d280a860af91ba29b3374a221b15 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:04:14,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:04:15,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:04:15,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:04:15,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:04:15,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:04:15,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:04:15,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:04:15,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:04:15,086 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:04:15,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:04:15,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:04:15,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:04:15,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:04:15,088 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:04:15,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:04:15,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:04:15,089 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:04:15,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:04:15,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:04:15,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:04:15,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:04:15,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:04:15,098 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:04:15,098 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:04:15,098 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:04:15,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:04:15,099 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:04:15,099 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:04:15,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:04:15,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:04:15,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:04:15,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:04:15,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:04:15,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:04:15,101 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:04:15,101 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:04:15,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:04:15,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:04:15,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:04:15,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:04:15,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:04:15,103 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 -> a15fad4ccd42e8290eb3eb8205bce76f0021d280a860af91ba29b3374a221b15 [2024-11-08 20:04:15,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:04:15,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:04:15,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:04:15,405 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:04:15,406 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:04:15,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-95.i [2024-11-08 20:04:16,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:04:17,084 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:04:17,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-95.i [2024-11-08 20:04:17,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/349b4fa46/f1deaa4edea74235a6264a323674a866/FLAGb19ae019d [2024-11-08 20:04:17,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/349b4fa46/f1deaa4edea74235a6264a323674a866 [2024-11-08 20:04:17,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:04:17,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:04:17,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:04:17,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:04:17,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:04:17,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:04:17" (1/1) ... [2024-11-08 20:04:17,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d28af62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:17, skipping insertion in model container [2024-11-08 20:04:17,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:04:17" (1/1) ... [2024-11-08 20:04:17,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:04:17,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-95.i[913,926] [2024-11-08 20:04:17,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:04:17,440 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:04:17,452 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_fillercode_fillercodesize_normal_file-95.i[913,926] [2024-11-08 20:04:17,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:04:17,519 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:04:17,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:17 WrapperNode [2024-11-08 20:04:17,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:04:17,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:04:17,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:04:17,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:04:17,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:17" (1/1) ... [2024-11-08 20:04:17,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:17" (1/1) ... [2024-11-08 20:04:17,588 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2024-11-08 20:04:17,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:04:17,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:04:17,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:04:17,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:04:17,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:17" (1/1) ... [2024-11-08 20:04:17,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:17" (1/1) ... [2024-11-08 20:04:17,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:17" (1/1) ... [2024-11-08 20:04:17,644 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-08 20:04:17,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:17" (1/1) ... [2024-11-08 20:04:17,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:17" (1/1) ... [2024-11-08 20:04:17,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:17" (1/1) ... [2024-11-08 20:04:17,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:17" (1/1) ... [2024-11-08 20:04:17,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:17" (1/1) ... [2024-11-08 20:04:17,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:17" (1/1) ... [2024-11-08 20:04:17,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:04:17,670 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:04:17,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:04:17,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:04:17,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:17" (1/1) ... [2024-11-08 20:04:17,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:04:17,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:04:17,713 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-08 20:04:17,715 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-08 20:04:17,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:04:17,755 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:04:17,755 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:04:17,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:04:17,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:04:17,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:04:17,835 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:04:17,837 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:04:18,168 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-08 20:04:18,168 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:04:18,182 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:04:18,182 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:04:18,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:04:18 BoogieIcfgContainer [2024-11-08 20:04:18,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:04:18,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:04:18,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:04:18,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:04:18,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:04:17" (1/3) ... [2024-11-08 20:04:18,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bebbb79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:04:18, skipping insertion in model container [2024-11-08 20:04:18,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:17" (2/3) ... [2024-11-08 20:04:18,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bebbb79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:04:18, skipping insertion in model container [2024-11-08 20:04:18,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:04:18" (3/3) ... [2024-11-08 20:04:18,193 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-95.i [2024-11-08 20:04:18,209 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:04:18,210 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:04:18,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:04:18,286 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;@17bbcc64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:04:18,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:04:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 48 states have internal predecessors, (69), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 20:04:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 20:04:18,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:04:18,301 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:04:18,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:04:18,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:04:18,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1632324354, now seen corresponding path program 1 times [2024-11-08 20:04:18,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:04:18,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944893010] [2024-11-08 20:04:18,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:04:18,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:04:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:18,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:04:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:18,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 20:04:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:18,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 20:04:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:18,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 20:04:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:18,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 20:04:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:18,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 20:04:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:18,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 20:04:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:18,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:04:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:18,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:04:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:18,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:04:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:18,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:04:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:18,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:04:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:18,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:04:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:18,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:04:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:18,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:04:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:18,696 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 20:04:18,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:04:18,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944893010] [2024-11-08 20:04:18,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944893010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:04:18,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:04:18,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:04:18,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718618506] [2024-11-08 20:04:18,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:04:18,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:04:18,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:04:18,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:04:18,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:04:18,746 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 48 states have internal predecessors, (69), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 20:04:18,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:04:18,769 INFO L93 Difference]: Finished difference Result 122 states and 205 transitions. [2024-11-08 20:04:18,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:04:18,771 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 104 [2024-11-08 20:04:18,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:04:18,777 INFO L225 Difference]: With dead ends: 122 [2024-11-08 20:04:18,777 INFO L226 Difference]: Without dead ends: 60 [2024-11-08 20:04:18,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-08 20:04:18,783 INFO L432 NwaCegarLoop]: 89 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, 89 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-08 20:04:18,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:04:18,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-08 20:04:18,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-08 20:04:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 20:04:18,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-08 20:04:18,823 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 104 [2024-11-08 20:04:18,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:04:18,824 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-08 20:04:18,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 20:04:18,824 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-08 20:04:18,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 20:04:18,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:04:18,830 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:04:18,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:04:18,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:04:18,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:04:18,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1138157052, now seen corresponding path program 1 times [2024-11-08 20:04:18,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:04:18,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351240760] [2024-11-08 20:04:18,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:04:18,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:04:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:34,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:04:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:34,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 20:04:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:34,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 20:04:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:34,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 20:04:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:34,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 20:04:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:34,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 20:04:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:34,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 20:04:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:34,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:04:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:34,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:04:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:34,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:04:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:34,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:04:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:34,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:04:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:34,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:04:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:34,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:04:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:34,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:04:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:34,705 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 20:04:34,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:04:34,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351240760] [2024-11-08 20:04:34,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351240760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:04:34,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:04:34,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 20:04:34,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360346077] [2024-11-08 20:04:34,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:04:34,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 20:04:34,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:04:34,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 20:04:34,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:04:34,710 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 20:04:35,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:04:35,179 INFO L93 Difference]: Finished difference Result 198 states and 277 transitions. [2024-11-08 20:04:35,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 20:04:35,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-11-08 20:04:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:04:35,183 INFO L225 Difference]: With dead ends: 198 [2024-11-08 20:04:35,183 INFO L226 Difference]: Without dead ends: 141 [2024-11-08 20:04:35,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:04:35,187 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 96 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:04:35,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 448 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 20:04:35,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-08 20:04:35,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 92. [2024-11-08 20:04:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.375) internal successors, (99), 73 states have internal predecessors, (99), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 20:04:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 133 transitions. [2024-11-08 20:04:35,220 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 133 transitions. Word has length 104 [2024-11-08 20:04:35,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:04:35,220 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 133 transitions. [2024-11-08 20:04:35,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 20:04:35,221 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 133 transitions. [2024-11-08 20:04:35,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 20:04:35,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:04:35,225 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:04:35,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:04:35,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:04:35,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:04:35,226 INFO L85 PathProgramCache]: Analyzing trace with hash -458098682, now seen corresponding path program 1 times [2024-11-08 20:04:35,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:04:35,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994292308] [2024-11-08 20:04:35,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:04:35,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:04:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:04:35,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [895368264] [2024-11-08 20:04:35,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:04:35,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:04:35,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:04:35,307 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-08 20:04:35,308 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-08 20:04:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:04:35,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:04:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:04:35,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:04:35,633 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:04:35,634 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:04:35,658 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-08 20:04:35,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:04:35,845 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 20:04:35,932 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:04:35,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:04:35 BoogieIcfgContainer [2024-11-08 20:04:35,936 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:04:35,937 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:04:35,937 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:04:35,937 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:04:35,938 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:04:18" (3/4) ... [2024-11-08 20:04:35,942 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:04:35,944 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:04:35,945 INFO L158 Benchmark]: Toolchain (without parser) took 18820.55ms. Allocated memory was 176.2MB in the beginning and 755.0MB in the end (delta: 578.8MB). Free memory was 122.0MB in the beginning and 449.3MB in the end (delta: -327.3MB). Peak memory consumption was 254.6MB. Max. memory is 16.1GB. [2024-11-08 20:04:35,946 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:04:35,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.50ms. Allocated memory is still 176.2MB. Free memory was 121.9MB in the beginning and 106.6MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 20:04:35,947 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.56ms. Allocated memory is still 176.2MB. Free memory was 106.6MB in the beginning and 103.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 20:04:35,947 INFO L158 Benchmark]: Boogie Preprocessor took 75.42ms. Allocated memory is still 176.2MB. Free memory was 103.1MB in the beginning and 98.2MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 20:04:35,947 INFO L158 Benchmark]: RCFGBuilder took 513.10ms. Allocated memory is still 176.2MB. Free memory was 98.2MB in the beginning and 76.5MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 20:04:35,948 INFO L158 Benchmark]: TraceAbstraction took 17751.10ms. Allocated memory was 176.2MB in the beginning and 755.0MB in the end (delta: 578.8MB). Free memory was 75.8MB in the beginning and 449.3MB in the end (delta: -373.4MB). Peak memory consumption was 208.5MB. Max. memory is 16.1GB. [2024-11-08 20:04:35,948 INFO L158 Benchmark]: Witness Printer took 6.95ms. Allocated memory is still 755.0MB. Free memory is still 449.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:04:35,954 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.50ms. Allocated memory is still 176.2MB. Free memory was 121.9MB in the beginning and 106.6MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.56ms. Allocated memory is still 176.2MB. Free memory was 106.6MB in the beginning and 103.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.42ms. Allocated memory is still 176.2MB. Free memory was 103.1MB in the beginning and 98.2MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 513.10ms. Allocated memory is still 176.2MB. Free memory was 98.2MB in the beginning and 76.5MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17751.10ms. Allocated memory was 176.2MB in the beginning and 755.0MB in the end (delta: 578.8MB). Free memory was 75.8MB in the beginning and 449.3MB in the end (delta: -373.4MB). Peak memory consumption was 208.5MB. Max. memory is 16.1GB. * Witness Printer took 6.95ms. Allocated memory is still 755.0MB. Free memory is still 449.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 116, overapproximation of someBinaryFLOATComparisonOperation at line 116. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 32; [L23] double var_1_2 = 32.25; [L24] double var_1_3 = 16.5; [L25] unsigned char var_1_4 = 10; [L26] unsigned char var_1_5 = 100; [L27] unsigned char var_1_6 = 1; [L28] signed char var_1_7 = -5; [L29] unsigned char var_1_8 = 0; [L30] signed char var_1_9 = -10; [L31] signed short int var_1_10 = 64; [L32] unsigned short int var_1_11 = 0; [L33] float var_1_12 = 64.75; [L34] double var_1_13 = 5.4; [L35] float var_1_14 = 5.625; [L36] unsigned long int var_1_15 = 32; [L37] unsigned short int last_1_var_1_11 = 0; [L38] float last_1_var_1_12 = 64.75; [L39] unsigned long int last_1_var_1_15 = 32; VAL [isInitial=0, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_2=129/4, var_1_3=33/2, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L120] isInitial = 1 [L121] FCALL initially() [L122] COND TRUE 1 [L123] CALL updateLastVariables() [L111] last_1_var_1_11 = var_1_11 [L112] last_1_var_1_12 = var_1_12 [L113] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_2=129/4, var_1_3=33/2, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L123] RET updateLastVariables() [L124] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_3=33/2, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_3=33/2, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L86] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_3=33/2, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L87] var_1_3 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L88] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L89] var_1_4 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L90] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L91] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L91] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L92] var_1_5 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_5 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L93] RET assume_abort_if_not(var_1_5 >= 63) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L94] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L94] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L95] var_1_6 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_7=-5, var_1_8=0, var_1_9=-10] [L96] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_7=-5, var_1_8=0, var_1_9=-10] [L97] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=0, var_1_9=-10] [L97] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=0, var_1_9=-10] [L98] var_1_8 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_9=-10] [L99] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_9=-10] [L100] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-10] [L100] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-10] [L101] var_1_9 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_9 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L102] RET assume_abort_if_not(var_1_9 >= -63) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L103] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L103] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L104] var_1_13 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L105] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L106] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L106] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L107] var_1_14 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L108] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L124] RET updateVariables() [L125] CALL step() [L43] unsigned long int stepLocal_1 = var_1_6 - last_1_var_1_15; VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, stepLocal_1=31, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L44] EXPR last_1_var_1_11 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, stepLocal_1=31, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L44] COND FALSE !(stepLocal_1 < ((last_1_var_1_11 ^ last_1_var_1_15) / ((((-8) > (var_1_5)) ? (-8) : (var_1_5))))) [L49] COND FALSE !((var_1_5 <= var_1_4) && var_1_8) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L56] COND TRUE (-8 * var_1_11) < var_1_4 [L57] var_1_7 = 1 VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] [L62] COND TRUE 128 >= last_1_var_1_15 [L63] var_1_15 = (var_1_6 + (var_1_4 + var_1_11)) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] [L67] COND FALSE !(var_1_2 != (var_1_3 / ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] [L70] COND FALSE !((10.8 + var_1_12) <= (- var_1_12)) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] [L73] unsigned char stepLocal_0 = var_1_4; VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] [L74] COND FALSE !(-4 >= stepLocal_0) [L81] var_1_10 = var_1_4 VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=1, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] [L125] RET step() [L126] CALL, EXPR property() [L116] EXPR (((((10.8 + var_1_12) <= (- var_1_12)) ? (var_1_1 == ((unsigned char) (((((1) < (var_1_4)) ? (1) : (var_1_4))) + (var_1_5 - var_1_6)))) : 1) && (((var_1_5 <= var_1_4) && var_1_8) ? (var_1_8 ? (var_1_7 == ((signed char) (var_1_6 + ((((5) < (var_1_9)) ? (5) : (var_1_9)))))) : (var_1_7 == ((signed char) ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9)))))) : (((-8 * var_1_11) < var_1_4) ? (var_1_7 == ((signed char) 1)) : (var_1_7 == ((signed char) var_1_9))))) && ((-4 >= var_1_4) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((signed short int) (var_1_7 + var_1_6))) : (var_1_10 == ((signed short int) var_1_5))) : (var_1_10 == ((signed short int) var_1_4)))) && (((var_1_6 - last_1_var_1_15) < ((last_1_var_1_11 ^ last_1_var_1_15) / ((((-8) > (var_1_5)) ? (-8) : (var_1_5))))) ? ((last_1_var_1_12 == last_1_var_1_12) ? (var_1_11 == ((unsigned short int) last_1_var_1_15)) : 1) : 1) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=1, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] [L116-L117] return (((((((10.8 + var_1_12) <= (- var_1_12)) ? (var_1_1 == ((unsigned char) (((((1) < (var_1_4)) ? (1) : (var_1_4))) + (var_1_5 - var_1_6)))) : 1) && (((var_1_5 <= var_1_4) && var_1_8) ? (var_1_8 ? (var_1_7 == ((signed char) (var_1_6 + ((((5) < (var_1_9)) ? (5) : (var_1_9)))))) : (var_1_7 == ((signed char) ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9)))))) : (((-8 * var_1_11) < var_1_4) ? (var_1_7 == ((signed char) 1)) : (var_1_7 == ((signed char) var_1_9))))) && ((-4 >= var_1_4) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((signed short int) (var_1_7 + var_1_6))) : (var_1_10 == ((signed short int) var_1_5))) : (var_1_10 == ((signed short int) var_1_4)))) && (((var_1_6 - last_1_var_1_15) < ((last_1_var_1_11 ^ last_1_var_1_15) / ((((-8) > (var_1_5)) ? (-8) : (var_1_5))))) ? ((last_1_var_1_12 == last_1_var_1_12) ? (var_1_11 == ((unsigned short int) last_1_var_1_15)) : 1) : 1)) && ((var_1_2 != (var_1_3 / ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (var_1_12 == ((float) var_1_14)) : 1)) && ((128 >= last_1_var_1_15) ? (var_1_15 == ((unsigned long int) (var_1_6 + (var_1_4 + var_1_11)))) : (var_1_15 == ((unsigned long int) var_1_7))) ; [L126] RET, EXPR property() [L126] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=1, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=1, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 537 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 345 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 192 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=2, InterpolantAutomatonStates: 9, 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, 2 MinimizatonAttempts, 49 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 751 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 840/840 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-08 20:04:35,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-95.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 a15fad4ccd42e8290eb3eb8205bce76f0021d280a860af91ba29b3374a221b15 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:04:38,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:04:38,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:04:38,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:04:38,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:04:38,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:04:38,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:04:38,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:04:38,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:04:38,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:04:38,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:04:38,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:04:38,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:04:38,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:04:38,415 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:04:38,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:04:38,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:04:38,419 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:04:38,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:04:38,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:04:38,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:04:38,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:04:38,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:04:38,421 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:04:38,422 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:04:38,422 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:04:38,422 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:04:38,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:04:38,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:04:38,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:04:38,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:04:38,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:04:38,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:04:38,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:04:38,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:04:38,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:04:38,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:04:38,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:04:38,426 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:04:38,427 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:04:38,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:04:38,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:04:38,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:04:38,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:04:38,429 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 -> a15fad4ccd42e8290eb3eb8205bce76f0021d280a860af91ba29b3374a221b15 [2024-11-08 20:04:38,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:04:38,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:04:38,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:04:38,800 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:04:38,801 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:04:38,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-95.i [2024-11-08 20:04:40,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:04:40,682 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:04:40,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-95.i [2024-11-08 20:04:40,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e44b00e9/c515081a3bb14bd28667175f2ed5f222/FLAGfdb935487 [2024-11-08 20:04:40,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e44b00e9/c515081a3bb14bd28667175f2ed5f222 [2024-11-08 20:04:40,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:04:40,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:04:40,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:04:40,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:04:40,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:04:40,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:04:40" (1/1) ... [2024-11-08 20:04:40,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a817224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:40, skipping insertion in model container [2024-11-08 20:04:40,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:04:40" (1/1) ... [2024-11-08 20:04:40,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:04:40,951 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_fillercode_fillercodesize_normal_file-95.i[913,926] [2024-11-08 20:04:41,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:04:41,054 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:04:41,068 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_fillercode_fillercodesize_normal_file-95.i[913,926] [2024-11-08 20:04:41,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:04:41,124 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:04:41,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:41 WrapperNode [2024-11-08 20:04:41,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:04:41,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:04:41,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:04:41,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:04:41,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:41" (1/1) ... [2024-11-08 20:04:41,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:41" (1/1) ... [2024-11-08 20:04:41,173 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-08 20:04:41,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:04:41,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:04:41,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:04:41,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:04:41,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:41" (1/1) ... [2024-11-08 20:04:41,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:41" (1/1) ... [2024-11-08 20:04:41,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:41" (1/1) ... [2024-11-08 20:04:41,213 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-08 20:04:41,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:41" (1/1) ... [2024-11-08 20:04:41,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:41" (1/1) ... [2024-11-08 20:04:41,228 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:41" (1/1) ... [2024-11-08 20:04:41,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:41" (1/1) ... [2024-11-08 20:04:41,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:41" (1/1) ... [2024-11-08 20:04:41,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:41" (1/1) ... [2024-11-08 20:04:41,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:04:41,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:04:41,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:04:41,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:04:41,256 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:41" (1/1) ... [2024-11-08 20:04:41,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:04:41,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:04:41,296 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-08 20:04:41,299 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-08 20:04:41,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:04:41,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:04:41,342 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:04:41,342 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:04:41,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:04:41,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:04:41,416 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:04:41,420 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:04:51,653 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-08 20:04:51,654 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:04:51,668 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:04:51,669 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:04:51,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:04:51 BoogieIcfgContainer [2024-11-08 20:04:51,670 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:04:51,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:04:51,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:04:51,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:04:51,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:04:40" (1/3) ... [2024-11-08 20:04:51,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42aa4443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:04:51, skipping insertion in model container [2024-11-08 20:04:51,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:04:41" (2/3) ... [2024-11-08 20:04:51,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42aa4443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:04:51, skipping insertion in model container [2024-11-08 20:04:51,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:04:51" (3/3) ... [2024-11-08 20:04:51,679 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-95.i [2024-11-08 20:04:51,695 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:04:51,695 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:04:51,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:04:51,761 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;@72b43a3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:04:51,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:04:51,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 20:04:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 20:04:51,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:04:51,784 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:04:51,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:04:51,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:04:51,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1733124500, now seen corresponding path program 1 times [2024-11-08 20:04:51,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:04:51,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728724572] [2024-11-08 20:04:51,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:04:51,810 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-08 20:04:51,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:04:51,816 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-08 20:04:51,817 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-08 20:04:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:52,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:04:52,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:04:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-08 20:04:52,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:04:52,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:04:52,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728724572] [2024-11-08 20:04:52,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728724572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:04:52,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:04:52,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:04:52,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955774947] [2024-11-08 20:04:52,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:04:52,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:04:52,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:04:52,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:04:52,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:04:52,772 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 20:04:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:04:52,796 INFO L93 Difference]: Finished difference Result 100 states and 169 transitions. [2024-11-08 20:04:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:04:52,798 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2024-11-08 20:04:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:04:52,804 INFO L225 Difference]: With dead ends: 100 [2024-11-08 20:04:52,804 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 20:04:52,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 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-08 20:04:52,810 INFO L432 NwaCegarLoop]: 71 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, 71 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-08 20:04:52,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:04:52,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 20:04:52,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-08 20:04:52,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 20:04:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2024-11-08 20:04:52,848 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 101 [2024-11-08 20:04:52,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:04:52,849 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2024-11-08 20:04:52,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 20:04:52,849 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2024-11-08 20:04:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 20:04:52,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:04:52,853 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:04:52,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 20:04:53,054 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-08 20:04:53,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:04:53,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:04:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash -614349018, now seen corresponding path program 1 times [2024-11-08 20:04:53,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:04:53,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372882204] [2024-11-08 20:04:53,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:04:53,058 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-08 20:04:53,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:04:53,060 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-08 20:04:53,062 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-08 20:04:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:04:53,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 20:04:53,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:04:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 20:04:58,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:04:58,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:04:58,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372882204] [2024-11-08 20:04:58,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372882204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:04:58,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:04:58,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:04:58,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585955052] [2024-11-08 20:04:58,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:04:58,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:04:58,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:04:58,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:04:58,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:04:58,713 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 20:05:03,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:05:05,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:05:11,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:05:15,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:05:19,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:05:19,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:19,472 INFO L93 Difference]: Finished difference Result 141 states and 207 transitions. [2024-11-08 20:05:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:05:19,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-08 20:05:19,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:19,550 INFO L225 Difference]: With dead ends: 141 [2024-11-08 20:05:19,550 INFO L226 Difference]: Without dead ends: 95 [2024-11-08 20:05:19,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:05:19,552 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:19,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 120 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 20.7s Time] [2024-11-08 20:05:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-08 20:05:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-11-08 20:05:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 60 states have internal predecessors, (77), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 20:05:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2024-11-08 20:05:19,573 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 101 [2024-11-08 20:05:19,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:19,574 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2024-11-08 20:05:19,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 20:05:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2024-11-08 20:05:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 20:05:19,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:19,576 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:05:19,600 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 (3)] Forceful destruction successful, exit code 0 [2024-11-08 20:05:19,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:05:19,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:19,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:19,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1160658344, now seen corresponding path program 1 times [2024-11-08 20:05:19,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:05:19,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064996834] [2024-11-08 20:05:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:19,779 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-08 20:05:19,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:05:19,781 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:05:19,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 20:05:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 20:05:20,573 INFO L278 TraceCheckSpWp]: Computing forward predicates...