./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-7.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d088ac5fc2da0d72c1ae551d8fda1eb109929d56d90266eacee133c324cf70b8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:38:54,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:38:54,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:38:54,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:38:54,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:38:54,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:38:54,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:38:54,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:38:54,997 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:38:54,999 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:38:54,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:38:55,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:38:55,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:38:55,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:38:55,002 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:38:55,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:38:55,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:38:55,003 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:38:55,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:38:55,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:38:55,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:38:55,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:38:55,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:38:55,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:38:55,007 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:38:55,007 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:38:55,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:38:55,008 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:38:55,008 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:38:55,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:38:55,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:38:55,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:38:55,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:38:55,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:38:55,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:38:55,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:38:55,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:38:55,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:38:55,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:38:55,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:38:55,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:38:55,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:38:55,012 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d088ac5fc2da0d72c1ae551d8fda1eb109929d56d90266eacee133c324cf70b8 [2024-10-11 12:38:55,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:38:55,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:38:55,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:38:55,305 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:38:55,305 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:38:55,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-7.i [2024-10-11 12:38:56,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:38:56,947 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:38:56,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-7.i [2024-10-11 12:38:56,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/99c6ac144/6ab0d9b49bdb42c7823351c057297a75/FLAG194668a97 [2024-10-11 12:38:56,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/99c6ac144/6ab0d9b49bdb42c7823351c057297a75 [2024-10-11 12:38:56,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:38:56,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:38:56,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:38:56,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:38:56,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:38:56,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:38:56" (1/1) ... [2024-10-11 12:38:56,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cbdfb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:56, skipping insertion in model container [2024-10-11 12:38:56,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:38:56" (1/1) ... [2024-10-11 12:38:57,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:38:57,206 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-7.i[914,927] [2024-10-11 12:38:57,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:38:57,253 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:38:57,263 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-7.i[914,927] [2024-10-11 12:38:57,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:38:57,298 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:38:57,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:57 WrapperNode [2024-10-11 12:38:57,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:38:57,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:38:57,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:38:57,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:38:57,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:57" (1/1) ... [2024-10-11 12:38:57,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:57" (1/1) ... [2024-10-11 12:38:57,347 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2024-10-11 12:38:57,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:38:57,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:38:57,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:38:57,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:38:57,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:57" (1/1) ... [2024-10-11 12:38:57,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:57" (1/1) ... [2024-10-11 12:38:57,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:57" (1/1) ... [2024-10-11 12:38:57,378 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:38:57,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:57" (1/1) ... [2024-10-11 12:38:57,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:57" (1/1) ... [2024-10-11 12:38:57,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:57" (1/1) ... [2024-10-11 12:38:57,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:57" (1/1) ... [2024-10-11 12:38:57,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:57" (1/1) ... [2024-10-11 12:38:57,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:57" (1/1) ... [2024-10-11 12:38:57,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:38:57,391 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:38:57,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:38:57,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:38:57,392 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:57" (1/1) ... [2024-10-11 12:38:57,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:38:57,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:38:57,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:38:57,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:38:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:38:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:38:57,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:38:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:38:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:38:57,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:38:57,564 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:38:57,566 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:38:57,748 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-11 12:38:57,749 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:38:57,792 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:38:57,793 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:38:57,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:38:57 BoogieIcfgContainer [2024-10-11 12:38:57,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:38:57,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:38:57,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:38:57,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:38:57,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:38:56" (1/3) ... [2024-10-11 12:38:57,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651a94e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:38:57, skipping insertion in model container [2024-10-11 12:38:57,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:57" (2/3) ... [2024-10-11 12:38:57,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651a94e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:38:57, skipping insertion in model container [2024-10-11 12:38:57,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:38:57" (3/3) ... [2024-10-11 12:38:57,801 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-7.i [2024-10-11 12:38:57,819 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:38:57,819 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:38:57,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:38:57,900 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;@3d6f80ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:38:57,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:38:57,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 12:38:57,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 12:38:57,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:38:57,915 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:38:57,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:38:57,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:38:57,922 INFO L85 PathProgramCache]: Analyzing trace with hash -53447056, now seen corresponding path program 1 times [2024-10-11 12:38:57,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:38:57,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188497674] [2024-10-11 12:38:57,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:38:57,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:38:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:58,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:38:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:58,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:38:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:58,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 12:38:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:58,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 12:38:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:58,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 12:38:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:58,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 12:38:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 12:38:58,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:38:58,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188497674] [2024-10-11 12:38:58,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188497674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:38:58,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:38:58,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:38:58,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763166473] [2024-10-11 12:38:58,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:38:58,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:38:58,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:38:58,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:38:58,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:38:58,273 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 12:38:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:38:58,316 INFO L93 Difference]: Finished difference Result 59 states and 94 transitions. [2024-10-11 12:38:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:38:58,321 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-10-11 12:38:58,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:38:58,333 INFO L225 Difference]: With dead ends: 59 [2024-10-11 12:38:58,333 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 12:38:58,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:38:58,340 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:38:58,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:38:58,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 12:38:58,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 12:38:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 12:38:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-10-11 12:38:58,370 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 44 [2024-10-11 12:38:58,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:38:58,370 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-10-11 12:38:58,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 12:38:58,371 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-10-11 12:38:58,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 12:38:58,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:38:58,372 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:38:58,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:38:58,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:38:58,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:38:58,373 INFO L85 PathProgramCache]: Analyzing trace with hash -550325010, now seen corresponding path program 1 times [2024-10-11 12:38:58,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:38:58,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937176747] [2024-10-11 12:38:58,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:38:58,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:38:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:59,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:38:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:59,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:38:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:59,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 12:38:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:59,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 12:38:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:59,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 12:38:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:59,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 12:38:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 12:38:59,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:38:59,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937176747] [2024-10-11 12:38:59,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937176747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:38:59,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:38:59,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:38:59,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230455384] [2024-10-11 12:38:59,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:38:59,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:38:59,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:38:59,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:38:59,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:38:59,213 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:38:59,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:38:59,261 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2024-10-11 12:38:59,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:38:59,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2024-10-11 12:38:59,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:38:59,266 INFO L225 Difference]: With dead ends: 61 [2024-10-11 12:38:59,266 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 12:38:59,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:38:59,269 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:38:59,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 46 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:38:59,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 12:38:59,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 12:38:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 12:38:59,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-10-11 12:38:59,290 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 44 [2024-10-11 12:38:59,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:38:59,290 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-10-11 12:38:59,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:38:59,291 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-10-11 12:38:59,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 12:38:59,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:38:59,293 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:38:59,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:38:59,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:38:59,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:38:59,295 INFO L85 PathProgramCache]: Analyzing trace with hash 110895024, now seen corresponding path program 1 times [2024-10-11 12:38:59,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:38:59,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474456570] [2024-10-11 12:38:59,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:38:59,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:38:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:38:59,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:38:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:38:59,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:38:59,416 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:38:59,419 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:38:59,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:38:59,425 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 12:38:59,468 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:38:59,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:38:59 BoogieIcfgContainer [2024-10-11 12:38:59,474 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:38:59,475 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:38:59,475 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:38:59,476 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:38:59,476 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:38:57" (3/4) ... [2024-10-11 12:38:59,478 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:38:59,479 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:38:59,480 INFO L158 Benchmark]: Toolchain (without parser) took 2498.30ms. Allocated memory was 167.8MB in the beginning and 232.8MB in the end (delta: 65.0MB). Free memory was 111.9MB in the beginning and 165.4MB in the end (delta: -53.5MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-10-11 12:38:59,480 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 167.8MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:38:59,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.72ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 98.2MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:38:59,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.62ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 96.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:38:59,484 INFO L158 Benchmark]: Boogie Preprocessor took 41.32ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 93.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:38:59,484 INFO L158 Benchmark]: RCFGBuilder took 402.92ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 77.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 12:38:59,484 INFO L158 Benchmark]: TraceAbstraction took 1678.59ms. Allocated memory was 167.8MB in the beginning and 232.8MB in the end (delta: 65.0MB). Free memory was 77.2MB in the beginning and 166.5MB in the end (delta: -89.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:38:59,485 INFO L158 Benchmark]: Witness Printer took 4.48ms. Allocated memory is still 232.8MB. Free memory was 166.5MB in the beginning and 165.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:38:59,487 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.33ms. Allocated memory is still 167.8MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.72ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 98.2MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.62ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 96.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.32ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 93.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 402.92ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 77.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1678.59ms. Allocated memory was 167.8MB in the beginning and 232.8MB in the end (delta: 65.0MB). Free memory was 77.2MB in the beginning and 166.5MB in the end (delta: -89.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.48ms. Allocated memory is still 232.8MB. Free memory was 166.5MB in the beginning and 165.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] float var_1_2 = 200.875; [L24] float var_1_3 = 8.2; [L25] float var_1_4 = 100000000000.4; [L26] unsigned char var_1_5 = 5; [L27] unsigned long int var_1_6 = 100; [L28] double var_1_9 = 4.6; [L29] double var_1_10 = 2.5; [L30] double last_1_var_1_9 = 4.6; [L80] isInitial = 1 [L81] FCALL initially() [L82] COND TRUE 1 [L83] CALL updateLastVariables() [L73] last_1_var_1_9 = var_1_9 [L83] RET updateLastVariables() [L84] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_float() [L61] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L61] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L62] var_1_3 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L63] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L64] var_1_4 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=5, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=5, var_1_6=100, var_1_9=23/5] [L65] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=5, var_1_6=100, var_1_9=23/5] [L66] var_1_5 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_6=100, var_1_9=23/5] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_6=100, var_1_9=23/5] [L68] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=-2, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=-2, var_1_6=100, var_1_9=23/5] [L68] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=-2, var_1_6=100, var_1_9=23/5] [L69] var_1_10 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_1=1, var_1_5=-2, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_1=1, var_1_5=-2, var_1_6=100, var_1_9=23/5] [L70] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=1, var_1_5=-2, var_1_6=100, var_1_9=23/5] [L84] RET updateVariables() [L85] CALL step() [L34] COND FALSE !(! (last_1_var_1_9 <= (var_1_3 - var_1_4))) [L45] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=-2, var_1_5=-2, var_1_6=100, var_1_9=23/5] [L47] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=-2, var_1_5=-2, var_1_6=100, var_1_9=23/5] [L48] COND FALSE !(stepLocal_0 < 0) [L51] var_1_6 = ((((((var_1_5) > (var_1_1)) ? (var_1_5) : (var_1_1))) + ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) + var_1_1) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=-2, var_1_5=-2, var_1_6=762, var_1_9=23/5] [L53] COND TRUE var_1_1 <= var_1_6 VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=-2, var_1_5=-2, var_1_6=762, var_1_9=23/5] [L54] COND TRUE var_1_2 >= var_1_3 [L55] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=100000000005, var_1_1=-2, var_1_5=-2, var_1_6=762, var_1_9=100000000005] [L85] RET step() [L86] CALL, EXPR property() [L76-L77] return (((! (last_1_var_1_9 <= (var_1_3 - var_1_4))) ? ((last_1_var_1_9 < var_1_3) ? ((! (var_1_3 > last_1_var_1_9)) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && ((var_1_5 < 0) ? (var_1_6 == ((unsigned long int) var_1_5)) : (var_1_6 == ((unsigned long int) ((((((var_1_5) > (var_1_1)) ? (var_1_5) : (var_1_1))) + ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) + var_1_1))))) && ((var_1_1 <= var_1_6) ? ((var_1_2 >= var_1_3) ? (var_1_9 == ((double) var_1_10)) : 1) : 1) ; [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=100000000005, var_1_1=-2, var_1_5=-2, var_1_6=762, var_1_9=100000000005] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=100000000005, var_1_1=-2, var_1_5=-2, var_1_6=762, var_1_9=100000000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 70 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 129 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 120/120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 12:38:59,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-7.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d088ac5fc2da0d72c1ae551d8fda1eb109929d56d90266eacee133c324cf70b8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:39:01,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:39:01,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:39:01,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:39:01,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:39:01,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:39:01,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:39:01,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:39:01,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:39:01,878 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:39:01,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:39:01,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:39:01,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:39:01,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:39:01,880 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:39:01,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:39:01,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:39:01,881 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:39:01,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:39:01,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:39:01,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:39:01,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:39:01,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:39:01,886 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:39:01,886 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:39:01,886 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:39:01,886 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:39:01,887 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:39:01,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:39:01,887 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:39:01,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:39:01,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:39:01,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:39:01,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:39:01,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:39:01,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:39:01,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:39:01,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:39:01,897 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:39:01,897 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:39:01,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:39:01,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:39:01,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:39:01,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:39:01,898 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:39:01,899 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d088ac5fc2da0d72c1ae551d8fda1eb109929d56d90266eacee133c324cf70b8 [2024-10-11 12:39:02,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:39:02,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:39:02,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:39:02,250 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:39:02,250 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:39:02,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-7.i [2024-10-11 12:39:03,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:39:03,967 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:39:03,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-7.i [2024-10-11 12:39:03,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a96407af5/048fa7fbc41040e79fcea0308bb98cb2/FLAG8cf9e1205 [2024-10-11 12:39:04,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a96407af5/048fa7fbc41040e79fcea0308bb98cb2 [2024-10-11 12:39:04,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:39:04,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:39:04,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:39:04,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:39:04,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:39:04,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:39:04" (1/1) ... [2024-10-11 12:39:04,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b99b0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:04, skipping insertion in model container [2024-10-11 12:39:04,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:39:04" (1/1) ... [2024-10-11 12:39:04,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:39:04,529 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-7.i[914,927] [2024-10-11 12:39:04,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:39:04,601 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:39:04,614 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-7.i[914,927] [2024-10-11 12:39:04,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:39:04,661 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:39:04,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:04 WrapperNode [2024-10-11 12:39:04,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:39:04,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:39:04,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:39:04,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:39:04,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:04" (1/1) ... [2024-10-11 12:39:04,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:04" (1/1) ... [2024-10-11 12:39:04,715 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2024-10-11 12:39:04,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:39:04,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:39:04,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:39:04,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:39:04,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:04" (1/1) ... [2024-10-11 12:39:04,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:04" (1/1) ... [2024-10-11 12:39:04,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:04" (1/1) ... [2024-10-11 12:39:04,755 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:39:04,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:04" (1/1) ... [2024-10-11 12:39:04,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:04" (1/1) ... [2024-10-11 12:39:04,768 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:04" (1/1) ... [2024-10-11 12:39:04,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:04" (1/1) ... [2024-10-11 12:39:04,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:04" (1/1) ... [2024-10-11 12:39:04,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:04" (1/1) ... [2024-10-11 12:39:04,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:39:04,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:39:04,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:39:04,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:39:04,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:04" (1/1) ... [2024-10-11 12:39:04,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:39:04,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:39:04,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:39:04,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:39:04,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:39:04,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:39:04,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:39:04,872 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:39:04,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:39:04,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:39:04,942 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:39:04,944 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:39:06,062 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-11 12:39:06,062 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:39:06,094 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:39:06,095 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:39:06,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:06 BoogieIcfgContainer [2024-10-11 12:39:06,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:39:06,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:39:06,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:39:06,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:39:06,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:39:04" (1/3) ... [2024-10-11 12:39:06,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d70c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:39:06, skipping insertion in model container [2024-10-11 12:39:06,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:04" (2/3) ... [2024-10-11 12:39:06,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d70c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:39:06, skipping insertion in model container [2024-10-11 12:39:06,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:06" (3/3) ... [2024-10-11 12:39:06,107 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-7.i [2024-10-11 12:39:06,122 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:39:06,123 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:39:06,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:39:06,178 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;@72d08844, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:39:06,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:39:06,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 12:39:06,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 12:39:06,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:39:06,192 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:39:06,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:39:06,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:39:06,200 INFO L85 PathProgramCache]: Analyzing trace with hash -53447056, now seen corresponding path program 1 times [2024-10-11 12:39:06,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:39:06,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908885874] [2024-10-11 12:39:06,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:39:06,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:39:06,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:39:06,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:39:06,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 12:39:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:06,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:39:06,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:39:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 12:39:06,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:39:06,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:39:06,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908885874] [2024-10-11 12:39:06,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908885874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:39:06,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:39:06,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:39:06,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346249462] [2024-10-11 12:39:06,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:39:06,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:39:06,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:39:06,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:39:06,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:39:06,512 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 12:39:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:39:06,549 INFO L93 Difference]: Finished difference Result 59 states and 94 transitions. [2024-10-11 12:39:06,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:39:06,552 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-10-11 12:39:06,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:39:06,559 INFO L225 Difference]: With dead ends: 59 [2024-10-11 12:39:06,559 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 12:39:06,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:39:06,567 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:39:06,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:39:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 12:39:06,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 12:39:06,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 12:39:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-10-11 12:39:06,600 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 44 [2024-10-11 12:39:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:39:06,600 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-10-11 12:39:06,600 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 12:39:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-10-11 12:39:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 12:39:06,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:39:06,602 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:39:06,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 12:39:06,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:39:06,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:39:06,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:39:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash -550325010, now seen corresponding path program 1 times [2024-10-11 12:39:06,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:39:06,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935744055] [2024-10-11 12:39:06,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:39:06,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:39:06,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:39:06,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:39:06,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 12:39:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:06,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:39:06,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:39:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 12:39:07,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:39:07,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:39:07,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935744055] [2024-10-11 12:39:07,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935744055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:39:07,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:39:07,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:39:07,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330108539] [2024-10-11 12:39:07,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:39:07,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:39:07,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:39:07,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:39:07,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:39:07,153 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:39:07,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:39:07,638 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2024-10-11 12:39:07,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:39:07,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2024-10-11 12:39:07,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:39:07,640 INFO L225 Difference]: With dead ends: 68 [2024-10-11 12:39:07,640 INFO L226 Difference]: Without dead ends: 40 [2024-10-11 12:39:07,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:39:07,642 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 34 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 12:39:07,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 63 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 12:39:07,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-11 12:39:07,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-10-11 12:39:07,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 12:39:07,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2024-10-11 12:39:07,659 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 44 [2024-10-11 12:39:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:39:07,660 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2024-10-11 12:39:07,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:39:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2024-10-11 12:39:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 12:39:07,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:39:07,663 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:39:07,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 12:39:07,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:39:07,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:39:07,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:39:07,865 INFO L85 PathProgramCache]: Analyzing trace with hash 110895024, now seen corresponding path program 1 times [2024-10-11 12:39:07,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:39:07,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398180091] [2024-10-11 12:39:07,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:39:07,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:39:07,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:39:07,869 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:39:07,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 12:39:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:08,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 12:39:08,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:39:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-11 12:39:34,153 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:39:34,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:39:34,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398180091] [2024-10-11 12:39:34,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398180091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:39:34,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:39:34,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 12:39:34,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482181696] [2024-10-11 12:39:34,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:39:34,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 12:39:34,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:39:34,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 12:39:34,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 12:39:34,159 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:39:36,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:39:36,311 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2024-10-11 12:39:36,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 12:39:36,313 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2024-10-11 12:39:36,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:39:36,314 INFO L225 Difference]: With dead ends: 62 [2024-10-11 12:39:36,315 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 12:39:36,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2024-10-11 12:39:36,316 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 72 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 12:39:36,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 83 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 12:39:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 12:39:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 45. [2024-10-11 12:39:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 12:39:36,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2024-10-11 12:39:36,327 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 45 [2024-10-11 12:39:36,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:39:36,328 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2024-10-11 12:39:36,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:39:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2024-10-11 12:39:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 12:39:36,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:39:36,330 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:39:36,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 12:39:36,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:39:36,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:39:36,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:39:36,532 INFO L85 PathProgramCache]: Analyzing trace with hash 110954606, now seen corresponding path program 1 times [2024-10-11 12:39:36,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:39:36,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688717890] [2024-10-11 12:39:36,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:39:36,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:39:36,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:39:36,537 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:39:36,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 12:39:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:36,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:39:36,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:39:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 12:39:48,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:39:48,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:39:48,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688717890] [2024-10-11 12:39:48,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688717890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:39:48,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:39:48,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 12:39:48,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825056795] [2024-10-11 12:39:48,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:39:48,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:39:48,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:39:48,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:39:48,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:39:48,119 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:39:50,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:39:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:39:50,526 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2024-10-11 12:39:50,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 12:39:50,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2024-10-11 12:39:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:39:50,529 INFO L225 Difference]: With dead ends: 48 [2024-10-11 12:39:50,530 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 12:39:50,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:39:50,531 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 19 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:39:50,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 141 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 12:39:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 12:39:50,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 12:39:50,535 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-10-11 12:39:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 12:39:50,535 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2024-10-11 12:39:50,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:39:50,536 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 12:39:50,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:39:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 12:39:50,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 12:39:50,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:39:50,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 12:39:50,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:39:50,744 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 12:39:50,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 12:39:51,491 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:39:51,504 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:39:51,505 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:39:51,505 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:39:51,506 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:39:51,506 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:39:51,506 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:39:51,509 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:39:51,509 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:39:51,510 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:39:51,511 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:39:51,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:39:51 BoogieIcfgContainer [2024-10-11 12:39:51,513 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:39:51,514 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:39:51,514 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:39:51,515 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:39:51,515 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:06" (3/4) ... [2024-10-11 12:39:51,518 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 12:39:51,522 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 12:39:51,527 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 12:39:51,528 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 12:39:51,528 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 12:39:51,528 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 12:39:51,629 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 12:39:51,630 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 12:39:51,630 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:39:51,631 INFO L158 Benchmark]: Toolchain (without parser) took 47309.23ms. Allocated memory was 60.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 40.4MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-10-11 12:39:51,631 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 60.8MB. Free memory was 35.5MB in the beginning and 35.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:39:51,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.25ms. Allocated memory is still 60.8MB. Free memory was 40.2MB in the beginning and 26.3MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:39:51,632 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.79ms. Allocated memory is still 60.8MB. Free memory was 26.1MB in the beginning and 24.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:39:51,632 INFO L158 Benchmark]: Boogie Preprocessor took 72.52ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 24.4MB in the beginning and 56.5MB in the end (delta: -32.1MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2024-10-11 12:39:51,632 INFO L158 Benchmark]: RCFGBuilder took 1305.56ms. Allocated memory is still 77.6MB. Free memory was 56.5MB in the beginning and 40.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 12:39:51,633 INFO L158 Benchmark]: TraceAbstraction took 45416.54ms. Allocated memory was 77.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 40.1MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 491.2MB. Max. memory is 16.1GB. [2024-10-11 12:39:51,636 INFO L158 Benchmark]: Witness Printer took 116.01ms. Allocated memory is still 1.4GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 12:39:51,638 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.23ms. Allocated memory is still 60.8MB. Free memory was 35.5MB in the beginning and 35.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.25ms. Allocated memory is still 60.8MB. Free memory was 40.2MB in the beginning and 26.3MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.79ms. Allocated memory is still 60.8MB. Free memory was 26.1MB in the beginning and 24.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.52ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 24.4MB in the beginning and 56.5MB in the end (delta: -32.1MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * RCFGBuilder took 1305.56ms. Allocated memory is still 77.6MB. Free memory was 56.5MB in the beginning and 40.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45416.54ms. Allocated memory was 77.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 40.1MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 491.2MB. Max. memory is 16.1GB. * Witness Printer took 116.01ms. Allocated memory is still 1.4GB. Free memory was 1.3GB in the beginning and 1.3GB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.6s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 126 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125 mSDsluCounter, 323 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 175 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 270 IncrementalHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 148 mSDtfsCounter, 270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred 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.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 37.8s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 575 SizeOfPredicates, 15 NumberOfNonLiveVariables, 322 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 240/240 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: 82]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (0 != cond) RESULT: Ultimate proved your program to be correct! [2024-10-11 12:39:51,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE