./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-92.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 8876f6eb9f613cb29715c4f42ee784bd0e24b5eed933337274de9fdb9ce0c47b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:40:49,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:40:49,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:40:49,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:40:49,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:40:49,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:40:49,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:40:49,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:40:49,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:40:49,316 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:40:49,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:40:49,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:40:49,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:40:49,317 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:40:49,318 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:40:49,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:40:49,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:40:49,319 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:40:49,319 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:40:49,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:40:49,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:40:49,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:40:49,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:40:49,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:40:49,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:40:49,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:40:49,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:40:49,324 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:40:49,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:40:49,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:40:49,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:40:49,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:40:49,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:40:49,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:40:49,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:40:49,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:40:49,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:40:49,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:40:49,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:40:49,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:40:49,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:40:49,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:40:49,328 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 -> 8876f6eb9f613cb29715c4f42ee784bd0e24b5eed933337274de9fdb9ce0c47b [2024-10-24 10:40:49,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:40:49,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:40:49,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:40:49,604 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:40:49,604 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:40:49,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-92.i [2024-10-24 10:40:50,780 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:40:50,981 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:40:50,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-92.i [2024-10-24 10:40:50,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77423cfbd/cfce599133234a19a62cb73464c58830/FLAGc72324dc1 [2024-10-24 10:40:51,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77423cfbd/cfce599133234a19a62cb73464c58830 [2024-10-24 10:40:51,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:40:51,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:40:51,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:40:51,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:40:51,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:40:51,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:40:51" (1/1) ... [2024-10-24 10:40:51,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51bcecb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:51, skipping insertion in model container [2024-10-24 10:40:51,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:40:51" (1/1) ... [2024-10-24 10:40:51,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:40:51,533 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-92.i[915,928] [2024-10-24 10:40:51,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:40:51,575 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:40:51,585 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-92.i[915,928] [2024-10-24 10:40:51,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:40:51,610 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:40:51,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:51 WrapperNode [2024-10-24 10:40:51,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:40:51,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:40:51,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:40:51,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:40:51,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:51" (1/1) ... [2024-10-24 10:40:51,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:51" (1/1) ... [2024-10-24 10:40:51,642 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-10-24 10:40:51,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:40:51,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:40:51,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:40:51,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:40:51,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:51" (1/1) ... [2024-10-24 10:40:51,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:51" (1/1) ... [2024-10-24 10:40:51,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:51" (1/1) ... [2024-10-24 10:40:51,666 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:40:51,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:51" (1/1) ... [2024-10-24 10:40:51,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:51" (1/1) ... [2024-10-24 10:40:51,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:51" (1/1) ... [2024-10-24 10:40:51,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:51" (1/1) ... [2024-10-24 10:40:51,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:51" (1/1) ... [2024-10-24 10:40:51,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:51" (1/1) ... [2024-10-24 10:40:51,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:40:51,678 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:40:51,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:40:51,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:40:51,679 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:51" (1/1) ... [2024-10-24 10:40:51,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:40:51,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:40:51,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:40:51,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:40:51,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:40:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:40:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:40:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:40:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:40:51,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:40:51,833 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:40:51,835 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:40:52,096 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 10:40:52,096 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:40:52,146 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:40:52,147 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:40:52,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:40:52 BoogieIcfgContainer [2024-10-24 10:40:52,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:40:52,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:40:52,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:40:52,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:40:52,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:40:51" (1/3) ... [2024-10-24 10:40:52,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da88e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:40:52, skipping insertion in model container [2024-10-24 10:40:52,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:51" (2/3) ... [2024-10-24 10:40:52,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da88e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:40:52, skipping insertion in model container [2024-10-24 10:40:52,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:40:52" (3/3) ... [2024-10-24 10:40:52,154 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-92.i [2024-10-24 10:40:52,168 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:40:52,169 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:40:52,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:40:52,220 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;@3552c340, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:40:52,220 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:40:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 10:40:52,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 10:40:52,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:52,231 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:52,232 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:52,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:52,235 INFO L85 PathProgramCache]: Analyzing trace with hash -476219463, now seen corresponding path program 1 times [2024-10-24 10:40:52,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:40:52,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687758927] [2024-10-24 10:40:52,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:52,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:40:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:40:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:40:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:40:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:40:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:40:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:40:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:40:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:40:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:40:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:40:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:40:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 10:40:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:40:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 10:40:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:40:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:40:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:40:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 10:40:52,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:40:52,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687758927] [2024-10-24 10:40:52,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687758927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:40:52,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:40:52,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:40:52,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606234080] [2024-10-24 10:40:52,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:40:52,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:40:52,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:40:52,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:40:52,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:40:52,542 INFO L87 Difference]: Start difference. First operand has 55 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 10:40:52,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:40:52,572 INFO L93 Difference]: Finished difference Result 107 states and 183 transitions. [2024-10-24 10:40:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:40:52,575 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2024-10-24 10:40:52,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:40:52,581 INFO L225 Difference]: With dead ends: 107 [2024-10-24 10:40:52,581 INFO L226 Difference]: Without dead ends: 53 [2024-10-24 10:40:52,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-10-24 10:40:52,587 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:40:52,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:40:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-24 10:40:52,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-24 10:40:52,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 10:40:52,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2024-10-24 10:40:52,620 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 79 transitions. Word has length 107 [2024-10-24 10:40:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:40:52,620 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 79 transitions. [2024-10-24 10:40:52,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 10:40:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 79 transitions. [2024-10-24 10:40:52,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 10:40:52,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:52,623 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:52,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:40:52,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:52,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:52,624 INFO L85 PathProgramCache]: Analyzing trace with hash -699036809, now seen corresponding path program 1 times [2024-10-24 10:40:52,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:40:52,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295313700] [2024-10-24 10:40:52,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:52,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:40:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:40:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:40:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:40:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:40:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:40:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:40:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:40:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:40:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:40:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:40:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:40:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 10:40:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:40:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 10:40:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:40:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:40:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:40:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 10:40:52,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:40:52,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295313700] [2024-10-24 10:40:52,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295313700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:40:52,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:40:52,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:40:52,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105790816] [2024-10-24 10:40:52,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:40:52,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:40:52,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:40:52,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:40:52,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:40:52,856 INFO L87 Difference]: Start difference. First operand 53 states and 79 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 10:40:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:40:52,905 INFO L93 Difference]: Finished difference Result 145 states and 215 transitions. [2024-10-24 10:40:52,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:40:52,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-10-24 10:40:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:40:52,909 INFO L225 Difference]: With dead ends: 145 [2024-10-24 10:40:52,909 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 10:40:52,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:40:52,911 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 55 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:40:52,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 194 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:40:52,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 10:40:52,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-10-24 10:40:52,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 58 states have internal predecessors, (74), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 10:40:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2024-10-24 10:40:52,930 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 107 [2024-10-24 10:40:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:40:52,931 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2024-10-24 10:40:52,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 10:40:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2024-10-24 10:40:52,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 10:40:52,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:52,933 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:52,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:40:52,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:52,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:52,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1508383435, now seen corresponding path program 1 times [2024-10-24 10:40:52,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:40:52,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613616046] [2024-10-24 10:40:52,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:52,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:40:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:40:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:40:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:40:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:40:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:40:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:40:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:40:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:40:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:40:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:40:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:40:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 10:40:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:40:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 10:40:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:40:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:40:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:40:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:53,239 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 10:40:53,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:40:53,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613616046] [2024-10-24 10:40:53,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613616046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:40:53,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:40:53,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:40:53,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434628783] [2024-10-24 10:40:53,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:40:53,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:40:53,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:40:53,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:40:53,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:40:53,243 INFO L87 Difference]: Start difference. First operand 90 states and 134 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 10:40:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:40:53,409 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2024-10-24 10:40:53,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:40:53,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-10-24 10:40:53,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:40:53,416 INFO L225 Difference]: With dead ends: 180 [2024-10-24 10:40:53,416 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 10:40:53,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:40:53,418 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 24 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:40:53,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 139 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:40:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 10:40:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-24 10:40:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 10:40:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-10-24 10:40:53,432 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 107 [2024-10-24 10:40:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:40:53,432 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-10-24 10:40:53,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 10:40:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-10-24 10:40:53,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 10:40:53,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:53,434 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:53,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:40:53,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:53,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1638938234, now seen corresponding path program 1 times [2024-10-24 10:40:53,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:40:53,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967875258] [2024-10-24 10:40:53,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:53,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:40:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 10:40:53,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [554602234] [2024-10-24 10:40:53,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:53,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:40:53,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:40:53,522 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-10-24 10:40:53,523 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-10-24 10:40:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:40:53,599 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:40:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:40:53,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:40:53,678 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:40:53,681 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:40:53,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 10:40:53,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:40:53,886 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 10:40:53,944 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:40:53,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:40:53 BoogieIcfgContainer [2024-10-24 10:40:53,946 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:40:53,947 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:40:53,947 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:40:53,947 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:40:53,947 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:40:52" (3/4) ... [2024-10-24 10:40:53,950 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:40:53,951 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:40:53,954 INFO L158 Benchmark]: Toolchain (without parser) took 2592.60ms. Allocated memory is still 184.5MB. Free memory was 156.6MB in the beginning and 78.5MB in the end (delta: 78.1MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. [2024-10-24 10:40:53,954 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:40:53,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.36ms. Allocated memory is still 184.5MB. Free memory was 156.6MB in the beginning and 143.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:40:53,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.41ms. Allocated memory is still 184.5MB. Free memory was 143.0MB in the beginning and 139.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:40:53,956 INFO L158 Benchmark]: Boogie Preprocessor took 30.26ms. Allocated memory is still 184.5MB. Free memory was 139.8MB in the beginning and 137.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:40:53,957 INFO L158 Benchmark]: RCFGBuilder took 469.14ms. Allocated memory is still 184.5MB. Free memory was 137.7MB in the beginning and 151.1MB in the end (delta: -13.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 10:40:53,958 INFO L158 Benchmark]: TraceAbstraction took 1797.67ms. Allocated memory is still 184.5MB. Free memory was 150.1MB in the beginning and 79.5MB in the end (delta: 70.5MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2024-10-24 10:40:53,958 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 184.5MB. Free memory is still 78.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:40:53,959 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.13ms. Allocated memory is still 109.1MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.36ms. Allocated memory is still 184.5MB. Free memory was 156.6MB in the beginning and 143.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.41ms. Allocated memory is still 184.5MB. Free memory was 143.0MB in the beginning and 139.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.26ms. Allocated memory is still 184.5MB. Free memory was 139.8MB in the beginning and 137.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 469.14ms. Allocated memory is still 184.5MB. Free memory was 137.7MB in the beginning and 151.1MB in the end (delta: -13.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1797.67ms. Allocated memory is still 184.5MB. Free memory was 150.1MB in the beginning and 79.5MB in the end (delta: 70.5MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 184.5MB. Free memory is still 78.5MB. 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 95, overapproximation of someBinaryFLOATComparisonOperation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_2 = 2; [L24] signed char var_1_3 = 8; [L25] signed char var_1_4 = 0; [L26] signed char var_1_5 = 32; [L27] signed char var_1_6 = 10; [L28] double var_1_7 = 1000000.625; [L29] double var_1_8 = 16.65; [L30] signed char var_1_9 = 25; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 0; [L33] float var_1_12 = 0.25; [L34] unsigned short int var_1_13 = 54726; [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_char() [L66] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L66] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L67] CALL assume_abort_if_not(var_1_2 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L67] RET assume_abort_if_not(var_1_2 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L68] var_1_3 = __VERIFIER_nondet_char() [L69] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L69] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L70] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L70] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L71] var_1_4 = __VERIFIER_nondet_char() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L73] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L73] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L74] var_1_5 = __VERIFIER_nondet_char() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L76] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L76] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L77] var_1_6 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L78] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L79] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L79] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L80] var_1_8 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L81] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L82] var_1_10 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L83] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L84] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L84] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L85] var_1_11 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L87] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L87] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L88] var_1_13 = __VERIFIER_nondet_ushort() [L89] CALL assume_abort_if_not(var_1_13 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L89] RET assume_abort_if_not(var_1_13 >= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L90] CALL assume_abort_if_not(var_1_13 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L90] RET assume_abort_if_not(var_1_13 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L103] RET updateVariables() [L104] CALL step() [L38] var_1_1 = ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))) [L39] signed char stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L40] EXPR var_1_6 & var_1_3 VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L40] COND TRUE ((~ var_1_5) * (var_1_6 & var_1_3)) >= stepLocal_0 [L41] var_1_7 = var_1_8 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L43] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L44] COND FALSE !(stepLocal_1 && var_1_11) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L47] signed long int stepLocal_4 = var_1_13 - var_1_5; [L48] unsigned char stepLocal_3 = var_1_10; [L49] unsigned char stepLocal_2 = var_1_10; VAL [isInitial=1, stepLocal_2=0, stepLocal_3=0, stepLocal_4=32767, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L50] COND FALSE !(var_1_11 || stepLocal_3) [L61] var_1_12 = var_1_8 VAL [isInitial=1, stepLocal_2=0, stepLocal_4=32767, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L95] EXPR var_1_6 & var_1_3 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L95] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L95-L96] return (((var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : 1)) && ((var_1_10 && var_1_11) ? (var_1_9 == ((signed char) (var_1_3 - var_1_2))) : 1)) && ((var_1_11 || var_1_10) ? ((var_1_10 || (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) < 32)) ? (((var_1_13 - var_1_5) < var_1_2) ? (var_1_12 == ((float) var_1_8)) : (var_1_12 == ((float) var_1_8))) : (var_1_12 == ((float) var_1_8))) : (var_1_12 == ((float) var_1_8))) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 409 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 155 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 84 IncrementalHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 254 mSDtfsCounter, 84 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 539 NumberOfCodeBlocks, 539 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 1133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1632/1632 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 10:40:53,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-92.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 8876f6eb9f613cb29715c4f42ee784bd0e24b5eed933337274de9fdb9ce0c47b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:40:55,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:40:55,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:40:55,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:40:55,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:40:55,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:40:55,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:40:55,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:40:55,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:40:55,879 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:40:55,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:40:55,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:40:55,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:40:55,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:40:55,882 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:40:55,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:40:55,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:40:55,882 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:40:55,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:40:55,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:40:55,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:40:55,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:40:55,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:40:55,886 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:40:55,886 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:40:55,887 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:40:55,887 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:40:55,887 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:40:55,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:40:55,887 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:40:55,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:40:55,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:40:55,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:40:55,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:40:55,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:40:55,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:40:55,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:40:55,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:40:55,895 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:40:55,896 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:40:55,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:40:55,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:40:55,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:40:55,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:40:55,897 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:40:55,897 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 -> 8876f6eb9f613cb29715c4f42ee784bd0e24b5eed933337274de9fdb9ce0c47b [2024-10-24 10:40:56,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:40:56,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:40:56,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:40:56,169 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:40:56,169 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:40:56,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-92.i [2024-10-24 10:40:57,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:40:57,585 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:40:57,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-92.i [2024-10-24 10:40:57,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941cb1010/1e1360609628427f9b04e2ce4a5f7083/FLAGb92b1c39f [2024-10-24 10:40:57,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941cb1010/1e1360609628427f9b04e2ce4a5f7083 [2024-10-24 10:40:57,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:40:57,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:40:57,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:40:57,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:40:57,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:40:57,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:40:57" (1/1) ... [2024-10-24 10:40:57,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@509241a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:57, skipping insertion in model container [2024-10-24 10:40:57,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:40:57" (1/1) ... [2024-10-24 10:40:57,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:40:57,765 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-92.i[915,928] [2024-10-24 10:40:57,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:40:57,833 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:40:57,844 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-92.i[915,928] [2024-10-24 10:40:57,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:40:57,881 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:40:57,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:57 WrapperNode [2024-10-24 10:40:57,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:40:57,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:40:57,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:40:57,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:40:57,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:57" (1/1) ... [2024-10-24 10:40:57,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:57" (1/1) ... [2024-10-24 10:40:57,925 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-10-24 10:40:57,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:40:57,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:40:57,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:40:57,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:40:57,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:57" (1/1) ... [2024-10-24 10:40:57,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:57" (1/1) ... [2024-10-24 10:40:57,944 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:57" (1/1) ... [2024-10-24 10:40:57,955 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:40:57,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:57" (1/1) ... [2024-10-24 10:40:57,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:57" (1/1) ... [2024-10-24 10:40:57,968 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:57" (1/1) ... [2024-10-24 10:40:57,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:57" (1/1) ... [2024-10-24 10:40:57,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:57" (1/1) ... [2024-10-24 10:40:57,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:57" (1/1) ... [2024-10-24 10:40:57,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:40:57,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:40:57,985 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:40:57,985 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:40:57,986 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:57" (1/1) ... [2024-10-24 10:40:57,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:40:58,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:40:58,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:40:58,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:40:58,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:40:58,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:40:58,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:40:58,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:40:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:40:58,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:40:58,134 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:40:58,136 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:40:58,830 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 10:40:58,830 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:40:58,880 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:40:58,881 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:40:58,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:40:58 BoogieIcfgContainer [2024-10-24 10:40:58,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:40:58,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:40:58,893 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:40:58,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:40:58,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:40:57" (1/3) ... [2024-10-24 10:40:58,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34da68be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:40:58, skipping insertion in model container [2024-10-24 10:40:58,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:57" (2/3) ... [2024-10-24 10:40:58,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34da68be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:40:58, skipping insertion in model container [2024-10-24 10:40:58,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:40:58" (3/3) ... [2024-10-24 10:40:58,900 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-92.i [2024-10-24 10:40:58,913 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:40:58,913 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:40:58,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:40:58,964 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;@30fa4867, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:40:58,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:40:58,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 10:40:58,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 10:40:58,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:58,975 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:58,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:58,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:58,979 INFO L85 PathProgramCache]: Analyzing trace with hash 12788562, now seen corresponding path program 1 times [2024-10-24 10:40:58,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:40:58,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154445228] [2024-10-24 10:40:58,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:58,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:40:58,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:40:58,991 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:40:58,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 10:40:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:59,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 10:40:59,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:40:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-24 10:40:59,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:40:59,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:40:59,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154445228] [2024-10-24 10:40:59,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154445228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:40:59,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:40:59,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:40:59,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980073089] [2024-10-24 10:40:59,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:40:59,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:40:59,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:40:59,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:40:59,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:40:59,222 INFO L87 Difference]: Start difference. First operand has 46 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 10:40:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:40:59,393 INFO L93 Difference]: Finished difference Result 89 states and 155 transitions. [2024-10-24 10:40:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:40:59,400 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 104 [2024-10-24 10:40:59,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:40:59,405 INFO L225 Difference]: With dead ends: 89 [2024-10-24 10:40:59,405 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 10:40:59,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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-10-24 10:40:59,410 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:40:59,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:40:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 10:40:59,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 10:40:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 10:40:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2024-10-24 10:40:59,446 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 104 [2024-10-24 10:40:59,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:40:59,446 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2024-10-24 10:40:59,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 10:40:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2024-10-24 10:40:59,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 10:40:59,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:59,449 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:59,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 10:40:59,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:40:59,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:59,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:59,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1236019116, now seen corresponding path program 1 times [2024-10-24 10:40:59,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:40:59,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403027229] [2024-10-24 10:40:59,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:59,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:40:59,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:40:59,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:40:59,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 10:40:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:59,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 10:40:59,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:40:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 10:40:59,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:40:59,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:40:59,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403027229] [2024-10-24 10:40:59,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403027229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:40:59,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:40:59,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:40:59,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044769581] [2024-10-24 10:40:59,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:40:59,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:40:59,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:40:59,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:40:59,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:40:59,850 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 10:41:00,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:41:00,130 INFO L93 Difference]: Finished difference Result 121 states and 178 transitions. [2024-10-24 10:41:00,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:41:00,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2024-10-24 10:41:00,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:41:00,133 INFO L225 Difference]: With dead ends: 121 [2024-10-24 10:41:00,133 INFO L226 Difference]: Without dead ends: 78 [2024-10-24 10:41:00,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:41:00,134 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 46 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 10:41:00,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 156 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 10:41:00,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-24 10:41:00,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2024-10-24 10:41:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 43 states have internal predecessors, (51), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 10:41:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2024-10-24 10:41:00,153 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 111 transitions. Word has length 104 [2024-10-24 10:41:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:41:00,153 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 111 transitions. [2024-10-24 10:41:00,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 10:41:00,154 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 111 transitions. [2024-10-24 10:41:00,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 10:41:00,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:41:00,156 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:41:00,161 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-10-24 10:41:00,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:41:00,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:41:00,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:41:00,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1178760814, now seen corresponding path program 1 times [2024-10-24 10:41:00,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:41:00,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485669403] [2024-10-24 10:41:00,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:41:00,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:41:00,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:41:00,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:41:00,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 10:41:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:00,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 10:41:00,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:41:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-24 10:41:06,471 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:41:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 10:41:29,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:41:29,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485669403] [2024-10-24 10:41:29,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485669403] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 10:41:29,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 10:41:29,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-10-24 10:41:29,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944950137] [2024-10-24 10:41:29,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 10:41:29,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 10:41:29,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:41:29,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 10:41:29,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-24 10:41:29,937 INFO L87 Difference]: Start difference. First operand 75 states and 111 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-24 10:41:45,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:41:45,084 INFO L93 Difference]: Finished difference Result 114 states and 155 transitions. [2024-10-24 10:41:45,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 10:41:45,094 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 104 [2024-10-24 10:41:45,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:41:45,096 INFO L225 Difference]: With dead ends: 114 [2024-10-24 10:41:45,097 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 10:41:45,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2024-10-24 10:41:45,100 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 102 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:41:45,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 171 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 13.0s Time] [2024-10-24 10:41:45,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 10:41:45,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 89. [2024-10-24 10:41:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 55 states have internal predecessors, (65), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 10:41:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 125 transitions. [2024-10-24 10:41:45,121 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 125 transitions. Word has length 104 [2024-10-24 10:41:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:41:45,122 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 125 transitions. [2024-10-24 10:41:45,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-24 10:41:45,122 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2024-10-24 10:41:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 10:41:45,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:41:45,125 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:41:45,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 10:41:45,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:41:45,326 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:41:45,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:41:45,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1988107440, now seen corresponding path program 1 times [2024-10-24 10:41:45,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:41:45,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762079074] [2024-10-24 10:41:45,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:41:45,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:41:45,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:41:45,330 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:41:45,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 10:41:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:45,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 10:41:45,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:41:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 350 proven. 78 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-24 10:41:56,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:42:28,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:42:28,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762079074] [2024-10-24 10:42:28,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762079074] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:42:28,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [542463030] [2024-10-24 10:42:28,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:42:28,790 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 10:42:28,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 10:42:28,793 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 10:42:28,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-24 10:42:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:42:29,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-24 10:42:29,116 INFO L278 TraceCheckSpWp]: Computing forward predicates...