./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.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 85b1d2ec59250ca50e4af3cfea516d1a969ce9b16ea60a43749666e7f67d56c7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:35:07,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:35:07,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:35:07,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:35:07,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:35:07,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:35:07,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:35:07,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:35:07,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:35:07,566 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:35:07,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:35:07,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:35:07,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:35:07,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:35:07,568 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:35:07,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:35:07,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:35:07,569 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:35:07,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:35:07,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:35:07,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:35:07,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:35:07,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:35:07,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:35:07,574 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:35:07,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:35:07,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:35:07,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:35:07,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:35:07,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:35:07,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:35:07,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:35:07,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:35:07,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:35:07,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:35:07,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:35:07,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:35:07,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:35:07,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:35:07,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:35:07,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:35:07,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:35:07,580 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 -> 85b1d2ec59250ca50e4af3cfea516d1a969ce9b16ea60a43749666e7f67d56c7 [2024-11-09 00:35:07,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:35:07,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:35:07,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:35:07,874 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:35:07,874 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:35:07,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i [2024-11-09 00:35:09,354 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:35:09,527 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:35:09,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i [2024-11-09 00:35:09,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8671226/4145e84743f540f994206cc7f3785aa4/FLAG76480ff99 [2024-11-09 00:35:09,927 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8671226/4145e84743f540f994206cc7f3785aa4 [2024-11-09 00:35:09,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:35:09,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:35:09,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:35:09,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:35:09,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:35:09,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:35:09" (1/1) ... [2024-11-09 00:35:09,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75436a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:09, skipping insertion in model container [2024-11-09 00:35:09,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:35:09" (1/1) ... [2024-11-09 00:35:09,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:35:10,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i[915,928] [2024-11-09 00:35:10,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:35:10,165 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:35:10,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i[915,928] [2024-11-09 00:35:10,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:35:10,206 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:35:10,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:10 WrapperNode [2024-11-09 00:35:10,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:35:10,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:35:10,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:35:10,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:35:10,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:10" (1/1) ... [2024-11-09 00:35:10,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:10" (1/1) ... [2024-11-09 00:35:10,239 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2024-11-09 00:35:10,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:35:10,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:35:10,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:35:10,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:35:10,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:10" (1/1) ... [2024-11-09 00:35:10,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:10" (1/1) ... [2024-11-09 00:35:10,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:10" (1/1) ... [2024-11-09 00:35:10,284 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:35:10,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:10" (1/1) ... [2024-11-09 00:35:10,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:10" (1/1) ... [2024-11-09 00:35:10,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:10" (1/1) ... [2024-11-09 00:35:10,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:10" (1/1) ... [2024-11-09 00:35:10,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:10" (1/1) ... [2024-11-09 00:35:10,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:10" (1/1) ... [2024-11-09 00:35:10,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:35:10,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:35:10,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:35:10,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:35:10,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:10" (1/1) ... [2024-11-09 00:35:10,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:35:10,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:35:10,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:35:10,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:35:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:35:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:35:10,387 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:35:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:35:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:35:10,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:35:10,473 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:35:10,476 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:35:10,673 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 00:35:10,674 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:35:10,686 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:35:10,687 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:35:10,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:10 BoogieIcfgContainer [2024-11-09 00:35:10,688 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:35:10,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:35:10,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:35:10,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:35:10,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:35:09" (1/3) ... [2024-11-09 00:35:10,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c1a8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:35:10, skipping insertion in model container [2024-11-09 00:35:10,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:10" (2/3) ... [2024-11-09 00:35:10,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c1a8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:35:10, skipping insertion in model container [2024-11-09 00:35:10,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:10" (3/3) ... [2024-11-09 00:35:10,699 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-80.i [2024-11-09 00:35:10,714 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:35:10,714 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:35:10,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:35:10,778 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;@3bab1b26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:35:10,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:35:10,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 00:35:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 00:35:10,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:10,789 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:10,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:10,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:10,793 INFO L85 PathProgramCache]: Analyzing trace with hash 211231747, now seen corresponding path program 1 times [2024-11-09 00:35:10,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:35:10,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940520258] [2024-11-09 00:35:10,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:10,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:35:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:35:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:35:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:35:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:35:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:35:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:35:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:35:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:35:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:35:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 00:35:11,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:35:11,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940520258] [2024-11-09 00:35:11,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940520258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:35:11,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:35:11,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:35:11,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920752331] [2024-11-09 00:35:11,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:35:11,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:35:11,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:35:11,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:35:11,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:35:11,114 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 00:35:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:11,136 INFO L93 Difference]: Finished difference Result 67 states and 106 transitions. [2024-11-09 00:35:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:35:11,139 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 66 [2024-11-09 00:35:11,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:11,144 INFO L225 Difference]: With dead ends: 67 [2024-11-09 00:35:11,144 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 00:35:11,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:35:11,149 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:11,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:35:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 00:35:11,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-09 00:35:11,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 00:35:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-11-09 00:35:11,181 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 66 [2024-11-09 00:35:11,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:11,181 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-11-09 00:35:11,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 00:35:11,182 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-11-09 00:35:11,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 00:35:11,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:11,185 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:11,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:35:11,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:11,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:11,186 INFO L85 PathProgramCache]: Analyzing trace with hash 409964679, now seen corresponding path program 1 times [2024-11-09 00:35:11,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:35:11,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684908907] [2024-11-09 00:35:11,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:11,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:35:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:35:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:35:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:35:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:35:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:35:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:35:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:35:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:35:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:35:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 00:35:11,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:35:11,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684908907] [2024-11-09 00:35:11,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684908907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:35:11,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:35:11,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:35:11,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294419317] [2024-11-09 00:35:11,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:35:11,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:35:11,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:35:11,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:35:11,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:35:11,988 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:12,178 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2024-11-09 00:35:12,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 00:35:12,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2024-11-09 00:35:12,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:12,182 INFO L225 Difference]: With dead ends: 77 [2024-11-09 00:35:12,182 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 00:35:12,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:35:12,185 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 76 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:12,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 239 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:35:12,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 00:35:12,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 54. [2024-11-09 00:35:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 00:35:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2024-11-09 00:35:12,206 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 66 [2024-11-09 00:35:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:12,207 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2024-11-09 00:35:12,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2024-11-09 00:35:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 00:35:12,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:12,209 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:12,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:35:12,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:12,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:12,210 INFO L85 PathProgramCache]: Analyzing trace with hash -411557169, now seen corresponding path program 1 times [2024-11-09 00:35:12,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:35:12,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193623969] [2024-11-09 00:35:12,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:12,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:12,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:35:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:12,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:35:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:12,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:35:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:12,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:35:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:12,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:35:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:12,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:35:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:12,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:35:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:12,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:35:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:12,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:35:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:12,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:35:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 00:35:12,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:35:12,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193623969] [2024-11-09 00:35:12,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193623969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:35:12,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:35:12,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 00:35:12,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526845892] [2024-11-09 00:35:12,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:35:12,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:35:12,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:35:12,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:35:12,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:35:12,937 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:13,291 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2024-11-09 00:35:13,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 00:35:13,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-09 00:35:13,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:13,295 INFO L225 Difference]: With dead ends: 94 [2024-11-09 00:35:13,295 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 00:35:13,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:35:13,297 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 89 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:13,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 233 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:35:13,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 00:35:13,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2024-11-09 00:35:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 38 states have internal predecessors, (40), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 00:35:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2024-11-09 00:35:13,330 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 67 [2024-11-09 00:35:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:13,330 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2024-11-09 00:35:13,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2024-11-09 00:35:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 00:35:13,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:13,332 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:13,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:35:13,333 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:13,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:13,333 INFO L85 PathProgramCache]: Analyzing trace with hash -409710127, now seen corresponding path program 1 times [2024-11-09 00:35:13,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:35:13,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314279909] [2024-11-09 00:35:13,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:13,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:35:13,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:35:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:35:13,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:35:13,411 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:35:13,412 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:35:13,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:35:13,417 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 00:35:13,470 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:35:13,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:35:13 BoogieIcfgContainer [2024-11-09 00:35:13,476 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:35:13,477 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:35:13,477 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:35:13,477 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:35:13,478 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:10" (3/4) ... [2024-11-09 00:35:13,480 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:35:13,482 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:35:13,483 INFO L158 Benchmark]: Toolchain (without parser) took 3551.48ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 106.1MB in the beginning and 170.9MB in the end (delta: -64.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:35:13,484 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:35:13,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.65ms. Allocated memory is still 176.2MB. Free memory was 105.9MB in the beginning and 92.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:35:13,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.78ms. Allocated memory is still 176.2MB. Free memory was 92.9MB in the beginning and 91.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:35:13,486 INFO L158 Benchmark]: Boogie Preprocessor took 56.84ms. Allocated memory is still 176.2MB. Free memory was 91.0MB in the beginning and 147.1MB in the end (delta: -56.1MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-11-09 00:35:13,486 INFO L158 Benchmark]: RCFGBuilder took 390.47ms. Allocated memory is still 176.2MB. Free memory was 147.1MB in the beginning and 134.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:35:13,487 INFO L158 Benchmark]: TraceAbstraction took 2785.24ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 132.8MB in the beginning and 170.9MB in the end (delta: -38.1MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-11-09 00:35:13,487 INFO L158 Benchmark]: Witness Printer took 4.93ms. Allocated memory is still 220.2MB. Free memory is still 170.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:35:13,488 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.65ms. Allocated memory is still 176.2MB. Free memory was 105.9MB in the beginning and 92.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.78ms. Allocated memory is still 176.2MB. Free memory was 92.9MB in the beginning and 91.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.84ms. Allocated memory is still 176.2MB. Free memory was 91.0MB in the beginning and 147.1MB in the end (delta: -56.1MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * RCFGBuilder took 390.47ms. Allocated memory is still 176.2MB. Free memory was 147.1MB in the beginning and 134.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2785.24ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 132.8MB in the beginning and 170.9MB in the end (delta: -38.1MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * Witness Printer took 4.93ms. Allocated memory is still 220.2MB. Free memory is still 170.9MB. 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 someBinaryFLOATComparisonOperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] float var_1_4 = 200.75; [L24] float var_1_5 = 5.7; [L25] signed short int var_1_6 = 200; [L26] signed short int var_1_7 = 256; [L27] signed short int var_1_8 = -16; [L28] unsigned char var_1_9 = 1; [L29] unsigned char var_1_10 = 0; VAL [isInitial=0, var_1_10=0, var_1_1=4, var_1_4=803/4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L65] isInitial = 1 [L66] FCALL initially() [L67] COND TRUE 1 [L68] FCALL updateLastVariables() [L69] CALL updateVariables() [L41] var_1_4 = __VERIFIER_nondet_float() [L42] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L42] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L43] var_1_5 = __VERIFIER_nondet_float() [L44] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L44] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L45] var_1_6 = __VERIFIER_nondet_short() [L46] CALL assume_abort_if_not(var_1_6 >= -8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L46] RET assume_abort_if_not(var_1_6 >= -8192) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L47] CALL assume_abort_if_not(var_1_6 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L47] RET assume_abort_if_not(var_1_6 <= 8192) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L48] var_1_7 = __VERIFIER_nondet_short() [L49] CALL assume_abort_if_not(var_1_7 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L49] RET assume_abort_if_not(var_1_7 >= -8191) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L50] CALL assume_abort_if_not(var_1_7 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L50] RET assume_abort_if_not(var_1_7 <= 8191) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L51] var_1_8 = __VERIFIER_nondet_short() [L52] CALL assume_abort_if_not(var_1_8 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L52] RET assume_abort_if_not(var_1_8 >= -16383) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L53] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L53] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L54] var_1_10 = __VERIFIER_nondet_uchar() [L55] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L55] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L56] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L56] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L69] RET updateVariables() [L70] CALL step() [L33] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L34] COND TRUE ! (var_1_9 && var_1_9) VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L35] COND FALSE !(var_1_4 <= var_1_5) VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L70] RET step() [L71] CALL, EXPR property() [L61-L62] return ((! (var_1_9 && var_1_9)) ? ((var_1_4 <= var_1_5) ? (var_1_1 == ((signed short int) ((((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) + var_1_7) + var_1_8))) : 1) : 1) && (var_1_9 == ((unsigned char) var_1_10)) ; VAL [\result=0, isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L71] RET, EXPR property() [L71] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L19] reach_error() VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 516 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 339 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 177 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=2, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 60 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 461 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 540/540 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 00:35:13,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.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 85b1d2ec59250ca50e4af3cfea516d1a969ce9b16ea60a43749666e7f67d56c7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:35:15,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:35:15,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:35:15,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:35:15,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:35:15,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:35:15,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:35:15,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:35:15,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:35:15,817 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:35:15,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:35:15,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:35:15,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:35:15,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:35:15,821 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:35:15,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:35:15,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:35:15,822 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:35:15,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:35:15,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:35:15,826 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:35:15,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:35:15,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:35:15,827 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:35:15,827 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:35:15,827 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:35:15,828 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:35:15,828 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:35:15,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:35:15,828 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:35:15,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:35:15,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:35:15,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:35:15,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:35:15,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:35:15,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:35:15,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:35:15,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:35:15,832 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:35:15,833 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:35:15,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:35:15,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:35:15,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:35:15,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:35:15,834 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 -> 85b1d2ec59250ca50e4af3cfea516d1a969ce9b16ea60a43749666e7f67d56c7 [2024-11-09 00:35:16,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:35:16,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:35:16,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:35:16,150 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:35:16,151 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:35:16,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i [2024-11-09 00:35:17,744 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:35:17,956 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:35:17,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i [2024-11-09 00:35:17,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d966f8017/dba8e769d4a345bba61cbbb264a0d67b/FLAG6b2995176 [2024-11-09 00:35:17,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d966f8017/dba8e769d4a345bba61cbbb264a0d67b [2024-11-09 00:35:17,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:35:17,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:35:17,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:35:17,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:35:18,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:35:18,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:35:17" (1/1) ... [2024-11-09 00:35:18,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf66319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:18, skipping insertion in model container [2024-11-09 00:35:18,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:35:17" (1/1) ... [2024-11-09 00:35:18,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:35:18,232 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i[915,928] [2024-11-09 00:35:18,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:35:18,292 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:35:18,305 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i[915,928] [2024-11-09 00:35:18,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:35:18,344 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:35:18,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:18 WrapperNode [2024-11-09 00:35:18,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:35:18,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:35:18,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:35:18,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:35:18,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:18" (1/1) ... [2024-11-09 00:35:18,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:18" (1/1) ... [2024-11-09 00:35:18,392 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 74 [2024-11-09 00:35:18,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:35:18,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:35:18,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:35:18,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:35:18,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:18" (1/1) ... [2024-11-09 00:35:18,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:18" (1/1) ... [2024-11-09 00:35:18,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:18" (1/1) ... [2024-11-09 00:35:18,425 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:35:18,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:18" (1/1) ... [2024-11-09 00:35:18,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:18" (1/1) ... [2024-11-09 00:35:18,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:18" (1/1) ... [2024-11-09 00:35:18,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:18" (1/1) ... [2024-11-09 00:35:18,442 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:18" (1/1) ... [2024-11-09 00:35:18,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:18" (1/1) ... [2024-11-09 00:35:18,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:35:18,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:35:18,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:35:18,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:35:18,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:18" (1/1) ... [2024-11-09 00:35:18,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:35:18,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:35:18,499 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:35:18,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:35:18,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:35:18,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:35:18,546 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:35:18,546 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:35:18,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:35:18,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:35:18,611 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:35:18,616 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:35:18,844 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 00:35:18,846 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:35:18,859 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:35:18,860 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:35:18,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:18 BoogieIcfgContainer [2024-11-09 00:35:18,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:35:18,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:35:18,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:35:18,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:35:18,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:35:17" (1/3) ... [2024-11-09 00:35:18,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123615ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:35:18, skipping insertion in model container [2024-11-09 00:35:18,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:18" (2/3) ... [2024-11-09 00:35:18,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123615ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:35:18, skipping insertion in model container [2024-11-09 00:35:18,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:18" (3/3) ... [2024-11-09 00:35:18,870 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-80.i [2024-11-09 00:35:18,886 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:35:18,886 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:35:18,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:35:18,972 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;@4fb91e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:35:18,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:35:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 00:35:18,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 00:35:18,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:18,985 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:18,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:18,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:18,991 INFO L85 PathProgramCache]: Analyzing trace with hash 211231747, now seen corresponding path program 1 times [2024-11-09 00:35:19,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:35:19,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302623306] [2024-11-09 00:35:19,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:19,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:35:19,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:35:19,009 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:35:19,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:35:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:19,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:35:19,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:35:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-09 00:35:19,211 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:35:19,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:35:19,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302623306] [2024-11-09 00:35:19,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302623306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:35:19,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:35:19,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:35:19,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781100369] [2024-11-09 00:35:19,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:35:19,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:35:19,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:35:19,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:35:19,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:35:19,247 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:19,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:19,271 INFO L93 Difference]: Finished difference Result 67 states and 106 transitions. [2024-11-09 00:35:19,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:35:19,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2024-11-09 00:35:19,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:19,280 INFO L225 Difference]: With dead ends: 67 [2024-11-09 00:35:19,281 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 00:35:19,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:35:19,288 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:19,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:35:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 00:35:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-09 00:35:19,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 00:35:19,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-11-09 00:35:19,330 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 66 [2024-11-09 00:35:19,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:19,331 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-11-09 00:35:19,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-11-09 00:35:19,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 00:35:19,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:19,335 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:19,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:35:19,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:35:19,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:19,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:19,537 INFO L85 PathProgramCache]: Analyzing trace with hash 409964679, now seen corresponding path program 1 times [2024-11-09 00:35:19,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:35:19,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117723482] [2024-11-09 00:35:19,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:19,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:35:19,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:35:19,540 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:35:19,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 00:35:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:19,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 00:35:19,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:35:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-09 00:35:19,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:35:19,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:35:19,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117723482] [2024-11-09 00:35:19,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117723482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:35:19,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:35:19,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:35:19,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299063514] [2024-11-09 00:35:19,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:35:19,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:35:19,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:35:19,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:35:19,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:35:19,801 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:20,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:20,205 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2024-11-09 00:35:20,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 00:35:20,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2024-11-09 00:35:20,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:20,209 INFO L225 Difference]: With dead ends: 97 [2024-11-09 00:35:20,209 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 00:35:20,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:35:20,212 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 56 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:20,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 121 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:35:20,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 00:35:20,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2024-11-09 00:35:20,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 00:35:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2024-11-09 00:35:20,226 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 66 [2024-11-09 00:35:20,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:20,227 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-11-09 00:35:20,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-11-09 00:35:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 00:35:20,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:20,229 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:20,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 00:35:20,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:35:20,430 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:20,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:20,430 INFO L85 PathProgramCache]: Analyzing trace with hash -411557169, now seen corresponding path program 1 times [2024-11-09 00:35:20,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:35:20,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703704351] [2024-11-09 00:35:20,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:20,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:35:20,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:35:20,434 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:35:20,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 00:35:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:20,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 00:35:20,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:35:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 124 proven. 24 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 00:35:22,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:35:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 00:35:22,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:35:22,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703704351] [2024-11-09 00:35:22,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703704351] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 00:35:22,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 00:35:22,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2024-11-09 00:35:22,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341824837] [2024-11-09 00:35:22,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:35:22,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:35:22,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:35:22,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:35:22,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2024-11-09 00:35:22,638 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:22,918 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2024-11-09 00:35:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 00:35:22,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-09 00:35:22,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:22,920 INFO L225 Difference]: With dead ends: 72 [2024-11-09 00:35:22,920 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 00:35:22,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2024-11-09 00:35:22,922 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 47 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:22,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 254 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:35:22,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 00:35:22,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 50. [2024-11-09 00:35:22,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 00:35:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2024-11-09 00:35:22,937 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 67 [2024-11-09 00:35:22,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:22,937 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2024-11-09 00:35:22,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-11-09 00:35:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 00:35:22,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:22,939 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:22,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 00:35:23,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:35:23,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:23,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:23,144 INFO L85 PathProgramCache]: Analyzing trace with hash -409710127, now seen corresponding path program 1 times [2024-11-09 00:35:23,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:35:23,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840768437] [2024-11-09 00:35:23,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:23,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:35:23,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:35:23,147 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:35:23,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 00:35:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:23,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 00:35:23,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:35:23,496 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 00:35:23,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:35:23,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:35:23,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840768437] [2024-11-09 00:35:23,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840768437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:35:23,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:35:23,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:35:23,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98753173] [2024-11-09 00:35:23,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:35:23,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:35:23,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:35:23,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:35:23,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:35:23,502 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:23,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:23,685 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2024-11-09 00:35:23,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 00:35:23,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-09 00:35:23,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:23,687 INFO L225 Difference]: With dead ends: 69 [2024-11-09 00:35:23,687 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 00:35:23,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:35:23,688 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 35 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:23,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 238 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:35:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 00:35:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 00:35:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 00:35:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 00:35:23,690 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2024-11-09 00:35:23,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:23,691 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 00:35:23,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:23,691 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 00:35:23,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:35:23,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:35:23,701 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 (5)] Ended with exit code 0 [2024-11-09 00:35:23,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:35:23,902 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 00:35:23,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 00:35:24,061 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:35:24,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:35:24 BoogieIcfgContainer [2024-11-09 00:35:24,080 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:35:24,081 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:35:24,081 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:35:24,081 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:35:24,082 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:18" (3/4) ... [2024-11-09 00:35:24,084 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:35:24,088 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 00:35:24,093 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 00:35:24,093 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 00:35:24,094 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 00:35:24,094 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:35:24,198 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 00:35:24,198 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 00:35:24,198 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:35:24,199 INFO L158 Benchmark]: Toolchain (without parser) took 6208.02ms. Allocated memory was 75.5MB in the beginning and 144.7MB in the end (delta: 69.2MB). Free memory was 43.6MB in the beginning and 43.2MB in the end (delta: 401.4kB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2024-11-09 00:35:24,199 INFO L158 Benchmark]: CDTParser took 1.65ms. Allocated memory is still 56.6MB. Free memory was 35.2MB in the beginning and 35.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:35:24,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.05ms. Allocated memory is still 75.5MB. Free memory was 43.4MB in the beginning and 49.8MB in the end (delta: -6.4MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-11-09 00:35:24,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.90ms. Allocated memory is still 75.5MB. Free memory was 49.8MB in the beginning and 48.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:35:24,201 INFO L158 Benchmark]: Boogie Preprocessor took 58.58ms. Allocated memory is still 75.5MB. Free memory was 48.2MB in the beginning and 46.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:35:24,201 INFO L158 Benchmark]: RCFGBuilder took 405.79ms. Allocated memory is still 75.5MB. Free memory was 46.0MB in the beginning and 33.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:35:24,201 INFO L158 Benchmark]: TraceAbstraction took 5216.18ms. Allocated memory was 75.5MB in the beginning and 144.7MB in the end (delta: 69.2MB). Free memory was 32.6MB in the beginning and 48.5MB in the end (delta: -15.8MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. [2024-11-09 00:35:24,201 INFO L158 Benchmark]: Witness Printer took 117.89ms. Allocated memory is still 144.7MB. Free memory was 48.5MB in the beginning and 43.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:35:24,203 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.65ms. Allocated memory is still 56.6MB. Free memory was 35.2MB in the beginning and 35.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.05ms. Allocated memory is still 75.5MB. Free memory was 43.4MB in the beginning and 49.8MB in the end (delta: -6.4MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.90ms. Allocated memory is still 75.5MB. Free memory was 49.8MB in the beginning and 48.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.58ms. Allocated memory is still 75.5MB. Free memory was 48.2MB in the beginning and 46.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 405.79ms. Allocated memory is still 75.5MB. Free memory was 46.0MB in the beginning and 33.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5216.18ms. Allocated memory was 75.5MB in the beginning and 144.7MB in the end (delta: 69.2MB). Free memory was 32.6MB in the beginning and 48.5MB in the end (delta: -15.8MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. * Witness Printer took 117.89ms. Allocated memory is still 144.7MB. Free memory was 48.5MB in the beginning and 43.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 148 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 657 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 432 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 249 IncrementalHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 225 mSDtfsCounter, 249 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=3, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 50 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 873 SizeOfPredicates, 21 NumberOfNonLiveVariables, 439 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 876/900 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: (var_1_10 <= 0) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && (((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10)))) RESULT: Ultimate proved your program to be correct! [2024-11-09 00:35:24,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE