./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:33:36,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:33:36,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:33:36,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:33:36,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:33:36,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:33:36,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:33:36,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:33:36,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:33:36,657 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:33:36,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:33:36,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:33:36,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:33:36,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:33:36,659 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:33:36,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:33:36,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:33:36,660 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:33:36,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:33:36,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:33:36,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:33:36,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:33:36,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:33:36,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:33:36,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:33:36,664 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:33:36,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:33:36,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:33:36,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:33:36,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:33:36,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:33:36,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:33:36,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:33:36,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:33:36,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:33:36,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:33:36,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:33:36,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:33:36,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:33:36,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:33:36,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:33:36,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:33:36,669 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 [2024-11-09 00:33:36,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:33:36,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:33:36,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:33:36,965 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:33:36,965 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:33:36,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2024-11-09 00:33:38,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:33:38,493 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:33:38,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2024-11-09 00:33:38,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/366c9f88b/32b45854e7484b12921f2e8e8f561135/FLAGa20da1261 [2024-11-09 00:33:38,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/366c9f88b/32b45854e7484b12921f2e8e8f561135 [2024-11-09 00:33:38,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:33:38,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:33:38,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:33:38,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:33:38,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:33:38,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:33:38" (1/1) ... [2024-11-09 00:33:38,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27560fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:38, skipping insertion in model container [2024-11-09 00:33:38,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:33:38" (1/1) ... [2024-11-09 00:33:38,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:33:38,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i[915,928] [2024-11-09 00:33:38,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:33:38,739 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:33:38,750 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i[915,928] [2024-11-09 00:33:38,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:33:38,773 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:33:38,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:38 WrapperNode [2024-11-09 00:33:38,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:33:38,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:33:38,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:33:38,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:33:38,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:38" (1/1) ... [2024-11-09 00:33:38,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:38" (1/1) ... [2024-11-09 00:33:38,806 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2024-11-09 00:33:38,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:33:38,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:33:38,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:33:38,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:33:38,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:38" (1/1) ... [2024-11-09 00:33:38,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:38" (1/1) ... [2024-11-09 00:33:38,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:38" (1/1) ... [2024-11-09 00:33:38,828 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:33:38,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:38" (1/1) ... [2024-11-09 00:33:38,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:38" (1/1) ... [2024-11-09 00:33:38,851 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:38" (1/1) ... [2024-11-09 00:33:38,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:38" (1/1) ... [2024-11-09 00:33:38,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:38" (1/1) ... [2024-11-09 00:33:38,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:38" (1/1) ... [2024-11-09 00:33:38,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:33:38,861 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:33:38,861 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:33:38,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:33:38,863 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:38" (1/1) ... [2024-11-09 00:33:38,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:33:38,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:33:38,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:33:38,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:33:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:33:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:33:38,947 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:33:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:33:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:33:38,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:33:39,028 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:33:39,033 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:33:39,298 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 00:33:39,298 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:33:39,314 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:33:39,315 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:33:39,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:33:39 BoogieIcfgContainer [2024-11-09 00:33:39,316 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:33:39,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:33:39,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:33:39,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:33:39,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:33:38" (1/3) ... [2024-11-09 00:33:39,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478b608e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:33:39, skipping insertion in model container [2024-11-09 00:33:39,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:38" (2/3) ... [2024-11-09 00:33:39,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478b608e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:33:39, skipping insertion in model container [2024-11-09 00:33:39,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:33:39" (3/3) ... [2024-11-09 00:33:39,327 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-47.i [2024-11-09 00:33:39,342 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:33:39,342 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:33:39,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:33:39,410 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;@3cce97d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:33:39,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:33:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 00:33:39,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 00:33:39,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:33:39,422 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:33:39,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:33:39,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:33:39,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1632482692, now seen corresponding path program 1 times [2024-11-09 00:33:39,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:33:39,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343753675] [2024-11-09 00:33:39,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:33:39,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:39,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:33:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:39,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:33:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:39,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:33:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:39,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:33:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:39,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:33:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:39,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:33:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:39,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:33:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:39,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:33:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:39,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:33:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:39,652 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 00:33:39,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:33:39,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343753675] [2024-11-09 00:33:39,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343753675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:33:39,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:33:39,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:33:39,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842055391] [2024-11-09 00:33:39,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:33:39,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:33:39,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:33:39,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:33:39,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:33:39,686 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 00:33:39,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:33:39,714 INFO L93 Difference]: Finished difference Result 79 states and 125 transitions. [2024-11-09 00:33:39,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:33:39,717 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2024-11-09 00:33:39,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:33:39,725 INFO L225 Difference]: With dead ends: 79 [2024-11-09 00:33:39,725 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 00:33:39,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:33:39,735 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:33:39,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:33:39,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 00:33:39,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-09 00:33:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 00:33:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2024-11-09 00:33:39,785 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 63 [2024-11-09 00:33:39,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:33:39,785 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2024-11-09 00:33:39,787 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 00:33:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2024-11-09 00:33:39,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 00:33:39,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:33:39,790 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:33:39,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:33:39,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:33:39,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:33:39,793 INFO L85 PathProgramCache]: Analyzing trace with hash 92022074, now seen corresponding path program 1 times [2024-11-09 00:33:39,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:33:39,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360971283] [2024-11-09 00:33:39,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:33:39,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:39,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:33:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:39,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:33:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:39,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:33:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:39,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:33:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:40,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:33:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:40,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:33:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:40,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:33:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:40,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:33:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:40,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:33:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:40,035 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 00:33:40,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:33:40,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360971283] [2024-11-09 00:33:40,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360971283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:33:40,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:33:40,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:33:40,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950977172] [2024-11-09 00:33:40,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:33:40,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:33:40,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:33:40,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:33:40,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:33:40,042 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:33:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:33:40,072 INFO L93 Difference]: Finished difference Result 76 states and 107 transitions. [2024-11-09 00:33:40,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:33:40,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2024-11-09 00:33:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:33:40,074 INFO L225 Difference]: With dead ends: 76 [2024-11-09 00:33:40,074 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 00:33:40,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-11-09 00:33:40,076 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:33:40,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:33:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 00:33:40,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 00:33:40,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 00:33:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2024-11-09 00:33:40,089 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 63 [2024-11-09 00:33:40,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:33:40,092 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2024-11-09 00:33:40,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:33:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2024-11-09 00:33:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 00:33:40,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:33:40,094 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:33:40,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:33:40,094 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:33:40,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:33:40,098 INFO L85 PathProgramCache]: Analyzing trace with hash -309560134, now seen corresponding path program 1 times [2024-11-09 00:33:40,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:33:40,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171372398] [2024-11-09 00:33:40,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:33:40,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:40,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:33:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:40,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:33:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:40,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:33:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:40,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:33:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:40,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:33:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:40,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:33:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:40,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:33:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:40,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:33:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:40,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:33:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 00:33:40,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:33:40,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171372398] [2024-11-09 00:33:40,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171372398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:33:40,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:33:40,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:33:40,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392685930] [2024-11-09 00:33:40,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:33:40,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:33:40,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:33:40,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:33:40,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:33:40,454 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:33:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:33:40,598 INFO L93 Difference]: Finished difference Result 90 states and 125 transitions. [2024-11-09 00:33:40,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 00:33:40,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2024-11-09 00:33:40,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:33:40,600 INFO L225 Difference]: With dead ends: 90 [2024-11-09 00:33:40,600 INFO L226 Difference]: Without dead ends: 53 [2024-11-09 00:33:40,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:33:40,602 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:33:40,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 207 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:33:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-09 00:33:40,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2024-11-09 00:33:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 00:33:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2024-11-09 00:33:40,609 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 64 [2024-11-09 00:33:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:33:40,609 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2024-11-09 00:33:40,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:33:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2024-11-09 00:33:40,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 00:33:40,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:33:40,612 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:33:40,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:33:40,612 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:33:40,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:33:40,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1850669615, now seen corresponding path program 1 times [2024-11-09 00:33:40,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:33:40,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848571789] [2024-11-09 00:33:40,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:33:40,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:33:40,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:33:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:33:40,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:33:40,703 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:33:40,704 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:33:40,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:33:40,708 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 00:33:40,760 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:33:40,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:33:40 BoogieIcfgContainer [2024-11-09 00:33:40,763 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:33:40,763 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:33:40,763 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:33:40,764 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:33:40,764 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:33:39" (3/4) ... [2024-11-09 00:33:40,766 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:33:40,769 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:33:40,769 INFO L158 Benchmark]: Toolchain (without parser) took 2248.30ms. Allocated memory is still 151.0MB. Free memory was 77.2MB in the beginning and 74.8MB in the end (delta: 2.4MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2024-11-09 00:33:40,770 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:33:40,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.20ms. Allocated memory is still 151.0MB. Free memory was 76.8MB in the beginning and 63.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:33:40,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.83ms. Allocated memory is still 151.0MB. Free memory was 63.9MB in the beginning and 61.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:33:40,771 INFO L158 Benchmark]: Boogie Preprocessor took 53.41ms. Allocated memory is still 151.0MB. Free memory was 61.8MB in the beginning and 124.0MB in the end (delta: -62.3MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-11-09 00:33:40,771 INFO L158 Benchmark]: RCFGBuilder took 455.35ms. Allocated memory is still 151.0MB. Free memory was 124.0MB in the beginning and 116.4MB in the end (delta: 7.7MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-11-09 00:33:40,775 INFO L158 Benchmark]: TraceAbstraction took 1443.84ms. Allocated memory is still 151.0MB. Free memory was 115.8MB in the beginning and 74.8MB in the end (delta: 41.0MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2024-11-09 00:33:40,775 INFO L158 Benchmark]: Witness Printer took 5.56ms. Allocated memory is still 151.0MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:33:40,777 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.20ms. Allocated memory is still 151.0MB. Free memory was 76.8MB in the beginning and 63.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.83ms. Allocated memory is still 151.0MB. Free memory was 63.9MB in the beginning and 61.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.41ms. Allocated memory is still 151.0MB. Free memory was 61.8MB in the beginning and 124.0MB in the end (delta: -62.3MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * RCFGBuilder took 455.35ms. Allocated memory is still 151.0MB. Free memory was 124.0MB in the beginning and 116.4MB in the end (delta: 7.7MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1443.84ms. Allocated memory is still 151.0MB. Free memory was 115.8MB in the beginning and 74.8MB in the end (delta: 41.0MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * Witness Printer took 5.56ms. Allocated memory is still 151.0MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 25.25; [L23] signed short int var_1_2 = -25; [L24] signed short int var_1_3 = -500; [L25] unsigned char var_1_4 = 1; [L26] unsigned char var_1_5 = 0; [L27] double var_1_6 = 127.25; VAL [isInitial=0, var_1_1=101/4, var_1_2=-25, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L64] isInitial = 1 [L65] FCALL initially() [L66] COND TRUE 1 [L67] FCALL updateLastVariables() [L68] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_short() [L43] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L43] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L44] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L44] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L45] var_1_3 = __VERIFIER_nondet_short() [L46] CALL assume_abort_if_not(var_1_3 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=509/4] [L46] RET assume_abort_if_not(var_1_3 >= -32768) VAL [isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=509/4] [L47] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=509/4] [L47] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=509/4] [L48] var_1_4 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=509/4] [L49] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=509/4] [L50] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=509/4] [L50] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=509/4] [L51] var_1_5 = __VERIFIER_nondet_uchar() [L52] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=509/4] [L52] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=509/4] [L53] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=509/4] [L53] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=509/4] [L54] var_1_6 = __VERIFIER_nondet_double() [L55] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=1] [L55] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=1] [L68] RET updateVariables() [L69] CALL step() [L31] EXPR var_1_2 & var_1_3 VAL [isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=1] [L31] COND TRUE (var_1_2 & var_1_3) >= -64 [L32] COND TRUE var_1_2 > var_1_3 VAL [isInitial=1, var_1_1=101/4, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=1] [L33] COND TRUE (var_1_2 > var_1_3) && (var_1_4 || var_1_5) [L34] var_1_1 = var_1_6 VAL [isInitial=1, var_1_1=132, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=132] [L69] RET step() [L70] CALL, EXPR property() [L60] EXPR var_1_2 & var_1_3 VAL [isInitial=1, var_1_1=132, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=132] [L60-L61] return ((var_1_2 & var_1_3) >= -64) ? ((var_1_2 > var_1_3) ? (((var_1_2 > var_1_3) && (var_1_4 || var_1_5)) ? (var_1_1 == ((double) var_1_6)) : (var_1_1 == ((double) var_1_6))) : 1) : 1 ; [L70] RET, EXPR property() [L70] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=132, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=132] [L19] reach_error() VAL [isInitial=1, var_1_1=132, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=132] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 361 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 84 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 156 mSDtfsCounter, 84 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=3, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 432/432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 00:33:40,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:33:42,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:33:42,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:33:42,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:33:42,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:33:43,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:33:43,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:33:43,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:33:43,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:33:43,004 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:33:43,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:33:43,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:33:43,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:33:43,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:33:43,008 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:33:43,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:33:43,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:33:43,009 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:33:43,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:33:43,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:33:43,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:33:43,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:33:43,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:33:43,011 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:33:43,012 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:33:43,012 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:33:43,012 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:33:43,013 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:33:43,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:33:43,013 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:33:43,014 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:33:43,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:33:43,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:33:43,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:33:43,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:33:43,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:33:43,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:33:43,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:33:43,015 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:33:43,015 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:33:43,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:33:43,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:33:43,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:33:43,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:33:43,017 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 [2024-11-09 00:33:43,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:33:43,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:33:43,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:33:43,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:33:43,355 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:33:43,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2024-11-09 00:33:44,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:33:45,060 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:33:45,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2024-11-09 00:33:45,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dcec6d6f/1a6e4f48d379414c8c47fc863f4d7255/FLAG7d93b5d4d [2024-11-09 00:33:45,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dcec6d6f/1a6e4f48d379414c8c47fc863f4d7255 [2024-11-09 00:33:45,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:33:45,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:33:45,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:33:45,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:33:45,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:33:45,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:33:45" (1/1) ... [2024-11-09 00:33:45,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2040e251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:45, skipping insertion in model container [2024-11-09 00:33:45,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:33:45" (1/1) ... [2024-11-09 00:33:45,128 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:33:45,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i[915,928] [2024-11-09 00:33:45,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:33:45,374 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:33:45,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i[915,928] [2024-11-09 00:33:45,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:33:45,422 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:33:45,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:45 WrapperNode [2024-11-09 00:33:45,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:33:45,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:33:45,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:33:45,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:33:45,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:45" (1/1) ... [2024-11-09 00:33:45,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:45" (1/1) ... [2024-11-09 00:33:45,468 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 69 [2024-11-09 00:33:45,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:33:45,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:33:45,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:33:45,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:33:45,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:45" (1/1) ... [2024-11-09 00:33:45,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:45" (1/1) ... [2024-11-09 00:33:45,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:45" (1/1) ... [2024-11-09 00:33:45,499 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:33:45,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:45" (1/1) ... [2024-11-09 00:33:45,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:45" (1/1) ... [2024-11-09 00:33:45,512 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:45" (1/1) ... [2024-11-09 00:33:45,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:45" (1/1) ... [2024-11-09 00:33:45,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:45" (1/1) ... [2024-11-09 00:33:45,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:45" (1/1) ... [2024-11-09 00:33:45,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:33:45,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:33:45,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:33:45,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:33:45,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:45" (1/1) ... [2024-11-09 00:33:45,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:33:45,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:33:45,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:33:45,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:33:45,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:33:45,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:33:45,600 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:33:45,600 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:33:45,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:33:45,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:33:45,663 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:33:45,667 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:33:45,858 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 00:33:45,858 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:33:45,871 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:33:45,873 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:33:45,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:33:45 BoogieIcfgContainer [2024-11-09 00:33:45,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:33:45,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:33:45,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:33:45,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:33:45,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:33:45" (1/3) ... [2024-11-09 00:33:45,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592631e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:33:45, skipping insertion in model container [2024-11-09 00:33:45,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:45" (2/3) ... [2024-11-09 00:33:45,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592631e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:33:45, skipping insertion in model container [2024-11-09 00:33:45,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:33:45" (3/3) ... [2024-11-09 00:33:45,882 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-47.i [2024-11-09 00:33:45,898 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:33:45,898 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:33:45,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:33:45,968 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;@6a6b4d91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:33:45,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:33:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 00:33:45,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 00:33:45,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:33:45,985 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:33:45,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:33:45,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:33:45,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1788319009, now seen corresponding path program 1 times [2024-11-09 00:33:46,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:33:46,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111112919] [2024-11-09 00:33:46,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:33:46,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:33:46,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:33:46,010 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:33:46,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:33:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:46,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:33:46,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:33:46,200 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-09 00:33:46,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:33:46,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:33:46,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111112919] [2024-11-09 00:33:46,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111112919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:33:46,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:33:46,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:33:46,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025799016] [2024-11-09 00:33:46,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:33:46,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:33:46,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:33:46,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:33:46,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:33:46,232 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 00:33:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:33:46,256 INFO L93 Difference]: Finished difference Result 65 states and 103 transitions. [2024-11-09 00:33:46,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:33:46,258 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 60 [2024-11-09 00:33:46,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:33:46,267 INFO L225 Difference]: With dead ends: 65 [2024-11-09 00:33:46,267 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 00:33:46,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:33:46,275 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:33:46,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:33:46,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 00:33:46,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 00:33:46,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 00:33:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-11-09 00:33:46,319 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 60 [2024-11-09 00:33:46,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:33:46,320 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-11-09 00:33:46,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 00:33:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-11-09 00:33:46,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 00:33:46,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:33:46,323 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:33:46,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 00:33:46,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:33:46,526 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:33:46,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:33:46,527 INFO L85 PathProgramCache]: Analyzing trace with hash 848607457, now seen corresponding path program 1 times [2024-11-09 00:33:46,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:33:46,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149473783] [2024-11-09 00:33:46,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:33:46,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:33:46,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:33:46,530 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:33:46,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 00:33:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:46,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 00:33:46,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:33:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 00:33:46,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:33:46,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:33:46,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149473783] [2024-11-09 00:33:46,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149473783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:33:46,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:33:46,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:33:46,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662687390] [2024-11-09 00:33:46,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:33:46,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:33:46,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:33:46,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:33:46,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:33:46,813 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:33:46,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:33:46,898 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2024-11-09 00:33:46,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:33:46,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2024-11-09 00:33:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:33:46,901 INFO L225 Difference]: With dead ends: 40 [2024-11-09 00:33:46,902 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 00:33:46,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:33:46,904 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:33:46,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 145 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:33:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 00:33:46,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-11-09 00:33:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 00:33:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-09 00:33:46,914 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 60 [2024-11-09 00:33:46,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:33:46,916 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-09 00:33:46,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:33:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-09 00:33:46,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 00:33:46,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:33:46,918 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:33:46,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 00:33:47,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:33:47,119 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:33:47,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:33:47,120 INFO L85 PathProgramCache]: Analyzing trace with hash 131539201, now seen corresponding path program 1 times [2024-11-09 00:33:47,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:33:47,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834351716] [2024-11-09 00:33:47,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:33:47,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:33:47,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:33:47,125 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:33:47,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 00:33:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:47,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 00:33:47,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:33:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 00:33:47,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:33:47,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:33:47,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834351716] [2024-11-09 00:33:47,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834351716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:33:47,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:33:47,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:33:47,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136698468] [2024-11-09 00:33:47,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:33:47,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:33:47,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:33:47,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:33:47,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:33:47,328 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:33:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:33:47,468 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2024-11-09 00:33:47,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 00:33:47,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 61 [2024-11-09 00:33:47,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:33:47,471 INFO L225 Difference]: With dead ends: 46 [2024-11-09 00:33:47,472 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 00:33:47,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:33:47,474 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 20 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:33:47,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 152 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:33:47,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 00:33:47,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2024-11-09 00:33:47,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 00:33:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-09 00:33:47,480 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 61 [2024-11-09 00:33:47,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:33:47,481 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-09 00:33:47,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:33:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-09 00:33:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 00:33:47,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:33:47,483 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:33:47,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 00:33:47,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:33:47,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:33:47,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:33:47,685 INFO L85 PathProgramCache]: Analyzing trace with hash -455582954, now seen corresponding path program 1 times [2024-11-09 00:33:47,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:33:47,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670488574] [2024-11-09 00:33:47,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:33:47,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:33:47,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:33:47,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:33:47,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 00:33:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:47,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 00:33:47,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:33:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 00:33:48,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:33:48,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:33:48,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670488574] [2024-11-09 00:33:48,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670488574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:33:48,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:33:48,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 00:33:48,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780684082] [2024-11-09 00:33:48,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:33:48,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 00:33:48,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:33:48,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 00:33:48,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:33:48,299 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:33:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:33:49,055 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-11-09 00:33:49,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 00:33:49,056 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 62 [2024-11-09 00:33:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:33:49,057 INFO L225 Difference]: With dead ends: 50 [2024-11-09 00:33:49,057 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 00:33:49,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2024-11-09 00:33:49,058 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 47 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:33:49,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 149 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:33:49,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 00:33:49,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 00:33:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 00:33:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 00:33:49,062 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2024-11-09 00:33:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:33:49,063 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 00:33:49,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:33:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 00:33:49,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:33:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:33:49,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 00:33:49,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:33:49,269 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 00:33:49,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 00:33:49,719 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:33:49,768 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-09 00:33:49,769 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-09 00:33:49,769 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-09 00:33:49,769 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-09 00:33:49,770 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-09 00:33:49,770 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-09 00:33:49,782 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-09 00:33:49,783 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-09 00:33:49,783 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-09 00:33:49,783 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-09 00:33:49,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:33:49 BoogieIcfgContainer [2024-11-09 00:33:49,789 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:33:49,794 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:33:49,794 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:33:49,794 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:33:49,795 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:33:45" (3/4) ... [2024-11-09 00:33:49,797 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:33:49,806 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 00:33:49,810 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 00:33:49,810 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 00:33:49,810 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 00:33:49,811 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:33:49,900 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 00:33:49,901 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 00:33:49,901 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:33:49,901 INFO L158 Benchmark]: Toolchain (without parser) took 4804.63ms. Allocated memory was 60.8MB in the beginning and 94.4MB in the end (delta: 33.6MB). Free memory was 28.3MB in the beginning and 66.0MB in the end (delta: -37.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:33:49,902 INFO L158 Benchmark]: CDTParser took 1.46ms. Allocated memory is still 46.1MB. Free memory was 24.9MB in the beginning and 24.8MB in the end (delta: 78.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:33:49,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.03ms. Allocated memory is still 60.8MB. Free memory was 28.1MB in the beginning and 32.5MB in the end (delta: -4.4MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-11-09 00:33:49,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.22ms. Allocated memory is still 60.8MB. Free memory was 32.5MB in the beginning and 30.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:33:49,903 INFO L158 Benchmark]: Boogie Preprocessor took 52.05ms. Allocated memory is still 60.8MB. Free memory was 30.8MB in the beginning and 28.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:33:49,903 INFO L158 Benchmark]: RCFGBuilder took 350.75ms. Allocated memory is still 60.8MB. Free memory was 28.4MB in the beginning and 33.9MB in the end (delta: -5.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-11-09 00:33:49,903 INFO L158 Benchmark]: TraceAbstraction took 3917.90ms. Allocated memory was 60.8MB in the beginning and 94.4MB in the end (delta: 33.6MB). Free memory was 33.3MB in the beginning and 70.9MB in the end (delta: -37.6MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2024-11-09 00:33:49,903 INFO L158 Benchmark]: Witness Printer took 107.34ms. Allocated memory is still 94.4MB. Free memory was 70.9MB in the beginning and 66.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:33:49,906 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.46ms. Allocated memory is still 46.1MB. Free memory was 24.9MB in the beginning and 24.8MB in the end (delta: 78.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.03ms. Allocated memory is still 60.8MB. Free memory was 28.1MB in the beginning and 32.5MB in the end (delta: -4.4MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.22ms. Allocated memory is still 60.8MB. Free memory was 32.5MB in the beginning and 30.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.05ms. Allocated memory is still 60.8MB. Free memory was 30.8MB in the beginning and 28.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 350.75ms. Allocated memory is still 60.8MB. Free memory was 28.4MB in the beginning and 33.9MB in the end (delta: -5.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3917.90ms. Allocated memory was 60.8MB in the beginning and 94.4MB in the end (delta: 33.6MB). Free memory was 33.3MB in the beginning and 70.9MB in the end (delta: -37.6MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * Witness Printer took 107.34ms. Allocated memory is still 94.4MB. Free memory was 70.9MB in the beginning and 66.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. 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, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 489 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 331 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222 IncrementalHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 158 mSDtfsCounter, 222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 27, 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, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 594 SizeOfPredicates, 13 NumberOfNonLiveVariables, 401 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 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: 66]: 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) && (((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6)))) RESULT: Ultimate proved your program to be correct! [2024-11-09 00:33:49,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE