./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.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 127e3a0cb76048ef1bf90b67c9d3d0888a5502aaa9e60e916cbe6b2df2fd80c6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:18:58,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:18:58,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:18:58,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:18:58,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:18:58,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:18:58,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:18:58,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:18:58,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:18:58,725 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:18:58,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:18:58,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:18:58,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:18:58,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:18:58,729 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:18:58,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:18:58,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:18:58,730 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:18:58,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:18:58,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:18:58,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:18:58,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:18:58,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:18:58,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:18:58,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:18:58,732 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:18:58,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:18:58,732 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:18:58,732 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:18:58,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:18:58,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:18:58,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:18:58,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:18:58,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:18:58,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:18:58,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:18:58,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:18:58,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:18:58,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:18:58,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:18:58,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:18:58,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:18:58,736 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 -> 127e3a0cb76048ef1bf90b67c9d3d0888a5502aaa9e60e916cbe6b2df2fd80c6 [2024-10-24 10:18:58,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:18:58,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:18:58,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:18:58,974 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:18:58,974 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:18:58,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i [2024-10-24 10:19:00,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:19:00,419 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:19:00,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i [2024-10-24 10:19:00,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5924c5a3/c4d3522c52a84a8b9ccf847698771349/FLAGcfa37fb7a [2024-10-24 10:19:00,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5924c5a3/c4d3522c52a84a8b9ccf847698771349 [2024-10-24 10:19:00,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:19:00,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:19:00,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:19:00,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:19:00,449 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:19:00,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:19:00" (1/1) ... [2024-10-24 10:19:00,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27698a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:00, skipping insertion in model container [2024-10-24 10:19:00,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:19:00" (1/1) ... [2024-10-24 10:19:00,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:19:00,600 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i[915,928] [2024-10-24 10:19:00,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:19:00,640 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:19:00,650 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i[915,928] [2024-10-24 10:19:00,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:19:00,672 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:19:00,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:00 WrapperNode [2024-10-24 10:19:00,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:19:00,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:19:00,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:19:00,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:19:00,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:00" (1/1) ... [2024-10-24 10:19:00,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:00" (1/1) ... [2024-10-24 10:19:00,704 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 69 [2024-10-24 10:19:00,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:19:00,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:19:00,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:19:00,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:19:00,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:00" (1/1) ... [2024-10-24 10:19:00,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:00" (1/1) ... [2024-10-24 10:19:00,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:00" (1/1) ... [2024-10-24 10:19:00,725 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:19:00,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:00" (1/1) ... [2024-10-24 10:19:00,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:00" (1/1) ... [2024-10-24 10:19:00,729 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:00" (1/1) ... [2024-10-24 10:19:00,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:00" (1/1) ... [2024-10-24 10:19:00,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:00" (1/1) ... [2024-10-24 10:19:00,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:00" (1/1) ... [2024-10-24 10:19:00,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:19:00,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:19:00,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:19:00,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:19:00,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:00" (1/1) ... [2024-10-24 10:19:00,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:19:00,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:19:00,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:19:00,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:19:00,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:19:00,866 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:19:00,866 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:19:00,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:19:00,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:19:00,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:19:00,930 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:19:00,932 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:19:01,071 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 10:19:01,071 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:19:01,102 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:19:01,103 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:19:01,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:01 BoogieIcfgContainer [2024-10-24 10:19:01,103 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:19:01,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:19:01,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:19:01,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:19:01,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:19:00" (1/3) ... [2024-10-24 10:19:01,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5020b46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:19:01, skipping insertion in model container [2024-10-24 10:19:01,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:00" (2/3) ... [2024-10-24 10:19:01,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5020b46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:19:01, skipping insertion in model container [2024-10-24 10:19:01,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:01" (3/3) ... [2024-10-24 10:19:01,120 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-38.i [2024-10-24 10:19:01,137 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:19:01,137 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:19:01,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:19:01,199 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;@4745878f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:19:01,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:19:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 10:19:01,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 10:19:01,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:01,212 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:19:01,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:01,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:01,219 INFO L85 PathProgramCache]: Analyzing trace with hash -263418443, now seen corresponding path program 1 times [2024-10-24 10:19:01,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:19:01,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758277543] [2024-10-24 10:19:01,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:01,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:19:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:01,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:19:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:01,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:19:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:01,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:19:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:01,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:19:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:01,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:19:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:01,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:19:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:01,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:19:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:01,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 10:19:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:19:01,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:19:01,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758277543] [2024-10-24 10:19:01,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758277543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:19:01,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:19:01,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:19:01,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085995653] [2024-10-24 10:19:01,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:19:01,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:19:01,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:19:01,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:19:01,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:19:01,488 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 10:19:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:19:01,515 INFO L93 Difference]: Finished difference Result 53 states and 86 transitions. [2024-10-24 10:19:01,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:19:01,518 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2024-10-24 10:19:01,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:19:01,523 INFO L225 Difference]: With dead ends: 53 [2024-10-24 10:19:01,524 INFO L226 Difference]: Without dead ends: 26 [2024-10-24 10:19:01,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:19:01,531 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:19:01,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:19:01,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-24 10:19:01,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-24 10:19:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 10:19:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2024-10-24 10:19:01,564 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 51 [2024-10-24 10:19:01,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:19:01,566 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2024-10-24 10:19:01,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 10:19:01,567 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-10-24 10:19:01,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 10:19:01,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:01,569 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:19:01,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:19:01,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:01,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:01,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1736276337, now seen corresponding path program 1 times [2024-10-24 10:19:01,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:19:01,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338737711] [2024-10-24 10:19:01,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:01,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:19:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:02,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:19:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:02,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:19:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:02,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:19:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:02,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:19:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:02,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:19:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:02,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:19:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:02,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:19:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:02,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 10:19:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:19:02,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:19:02,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338737711] [2024-10-24 10:19:02,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338737711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:19:02,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:19:02,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:19:02,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856427690] [2024-10-24 10:19:02,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:19:02,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:19:02,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:19:02,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:19:02,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:19:02,174 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:19:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:19:02,267 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2024-10-24 10:19:02,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:19:02,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 51 [2024-10-24 10:19:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:19:02,268 INFO L225 Difference]: With dead ends: 43 [2024-10-24 10:19:02,268 INFO L226 Difference]: Without dead ends: 41 [2024-10-24 10:19:02,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:19:02,270 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 24 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:19:02,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 133 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:19:02,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-24 10:19:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-10-24 10:19:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 10:19:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2024-10-24 10:19:02,280 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 51 [2024-10-24 10:19:02,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:19:02,280 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2024-10-24 10:19:02,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:19:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2024-10-24 10:19:02,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 10:19:02,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:02,282 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:19:02,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:19:02,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:02,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:02,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2018963012, now seen corresponding path program 1 times [2024-10-24 10:19:02,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:19:02,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470404933] [2024-10-24 10:19:02,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:02,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:19:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:19:02,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:19:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:19:02,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:19:02,345 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:19:02,346 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:19:02,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:19:02,350 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 10:19:02,392 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:19:02,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:19:02 BoogieIcfgContainer [2024-10-24 10:19:02,396 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:19:02,397 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:19:02,397 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:19:02,397 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:19:02,398 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:01" (3/4) ... [2024-10-24 10:19:02,399 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:19:02,400 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:19:02,400 INFO L158 Benchmark]: Toolchain (without parser) took 1958.01ms. Allocated memory is still 174.1MB. Free memory was 107.9MB in the beginning and 123.5MB in the end (delta: -15.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:19:02,401 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 109.1MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:19:02,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.41ms. Allocated memory is still 174.1MB. Free memory was 107.6MB in the beginning and 94.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 10:19:02,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.73ms. Allocated memory is still 174.1MB. Free memory was 94.5MB in the beginning and 92.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:19:02,402 INFO L158 Benchmark]: Boogie Preprocessor took 43.82ms. Allocated memory is still 174.1MB. Free memory was 92.7MB in the beginning and 148.1MB in the end (delta: -55.3MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-10-24 10:19:02,402 INFO L158 Benchmark]: RCFGBuilder took 354.25ms. Allocated memory is still 174.1MB. Free memory was 148.1MB in the beginning and 134.1MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 10:19:02,402 INFO L158 Benchmark]: TraceAbstraction took 1286.55ms. Allocated memory is still 174.1MB. Free memory was 133.4MB in the beginning and 123.5MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 10:19:02,402 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 174.1MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:19:02,405 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.09ms. Allocated memory is still 109.1MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.41ms. Allocated memory is still 174.1MB. Free memory was 107.6MB in the beginning and 94.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.73ms. Allocated memory is still 174.1MB. Free memory was 94.5MB in the beginning and 92.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.82ms. Allocated memory is still 174.1MB. Free memory was 92.7MB in the beginning and 148.1MB in the end (delta: -55.3MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * RCFGBuilder took 354.25ms. Allocated memory is still 174.1MB. Free memory was 148.1MB in the beginning and 134.1MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1286.55ms. Allocated memory is still 174.1MB. Free memory was 133.4MB in the beginning and 123.5MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 174.1MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 256.2; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] unsigned short int var_1_5 = 0; [L26] float var_1_6 = 10.125; [L27] float var_1_7 = 9.4; [L28] unsigned long int var_1_8 = 50; [L63] isInitial = 1 [L64] FCALL initially() [L65] COND TRUE 1 [L66] FCALL updateLastVariables() [L67] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_uchar() [L43] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_3=0, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_3=0, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L43] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=1281/5, var_1_3=0, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L44] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L44] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L45] var_1_3 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L46] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L47] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L47] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L48] var_1_5 = __VERIFIER_nondet_ushort() [L49] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L49] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L50] CALL assume_abort_if_not(var_1_5 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L50] RET assume_abort_if_not(var_1_5 <= 65535) VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L51] var_1_6 = __VERIFIER_nondet_float() [L52] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_7=47/5, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_7=47/5, var_1_8=50] [L52] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_7=47/5, var_1_8=50] [L53] var_1_7 = __VERIFIER_nondet_float() [L54] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_8=50] [L54] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_8=50] [L67] RET updateVariables() [L68] CALL step() [L32] var_1_8 = var_1_5 VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_5=0, var_1_8=0] [L33] COND TRUE var_1_2 || var_1_3 VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_5=0, var_1_8=0] [L34] COND FALSE !(var_1_8 != var_1_8) [L37] var_1_1 = var_1_6 VAL [isInitial=1, var_1_1=261, var_1_2=1, var_1_3=1, var_1_5=0, var_1_6=261, var_1_8=0] [L68] RET step() [L69] CALL, EXPR property() [L59-L60] return ((var_1_2 || var_1_3) ? ((var_1_8 != var_1_8) ? (var_1_1 == ((float) ((((-0.4f) > (((((var_1_6 + var_1_7) < 0 ) ? -(var_1_6 + var_1_7) : (var_1_6 + var_1_7))))) ? (-0.4f) : (((((var_1_6 + var_1_7) < 0 ) ? -(var_1_6 + var_1_7) : (var_1_6 + var_1_7)))))))) : (var_1_1 == ((float) var_1_6))) : 1) && (var_1_8 == ((unsigned long int) var_1_5)) ; [L69] RET, EXPR property() [L69] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=261, var_1_2=1, var_1_3=1, var_1_5=0, var_1_6=261, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_1=261, var_1_2=1, var_1_3=1, var_1_5=0, var_1_6=261, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 164 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 74 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 224/224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 10:19:02,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.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 127e3a0cb76048ef1bf90b67c9d3d0888a5502aaa9e60e916cbe6b2df2fd80c6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:19:04,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:19:04,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:19:04,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:19:04,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:19:04,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:19:04,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:19:04,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:19:04,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:19:04,379 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:19:04,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:19:04,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:19:04,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:19:04,382 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:19:04,383 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:19:04,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:19:04,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:19:04,383 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:19:04,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:19:04,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:19:04,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:19:04,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:19:04,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:19:04,385 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:19:04,385 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:19:04,386 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:19:04,386 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:19:04,386 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:19:04,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:19:04,387 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:19:04,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:19:04,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:19:04,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:19:04,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:19:04,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:19:04,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:19:04,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:19:04,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:19:04,389 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:19:04,389 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:19:04,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:19:04,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:19:04,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:19:04,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:19:04,390 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:19:04,390 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 -> 127e3a0cb76048ef1bf90b67c9d3d0888a5502aaa9e60e916cbe6b2df2fd80c6 [2024-10-24 10:19:04,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:19:04,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:19:04,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:19:04,703 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:19:04,704 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:19:04,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i [2024-10-24 10:19:06,062 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:19:06,221 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:19:06,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i [2024-10-24 10:19:06,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72cad1897/926bac4e92554507b5e64322b2dea4c5/FLAG9ce42b3a0 [2024-10-24 10:19:06,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72cad1897/926bac4e92554507b5e64322b2dea4c5 [2024-10-24 10:19:06,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:19:06,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:19:06,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:19:06,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:19:06,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:19:06,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:19:06" (1/1) ... [2024-10-24 10:19:06,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af19812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:06, skipping insertion in model container [2024-10-24 10:19:06,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:19:06" (1/1) ... [2024-10-24 10:19:06,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:19:06,826 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i[915,928] [2024-10-24 10:19:06,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:19:06,878 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:19:06,889 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i[915,928] [2024-10-24 10:19:06,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:19:06,922 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:19:06,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:06 WrapperNode [2024-10-24 10:19:06,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:19:06,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:19:06,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:19:06,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:19:06,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:06" (1/1) ... [2024-10-24 10:19:06,940 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:06" (1/1) ... [2024-10-24 10:19:06,970 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 69 [2024-10-24 10:19:06,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:19:06,972 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:19:06,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:19:06,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:19:06,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:06" (1/1) ... [2024-10-24 10:19:06,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:06" (1/1) ... [2024-10-24 10:19:06,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:06" (1/1) ... [2024-10-24 10:19:06,995 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:19:06,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:06" (1/1) ... [2024-10-24 10:19:06,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:06" (1/1) ... [2024-10-24 10:19:07,008 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:06" (1/1) ... [2024-10-24 10:19:07,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:06" (1/1) ... [2024-10-24 10:19:07,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:06" (1/1) ... [2024-10-24 10:19:07,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:06" (1/1) ... [2024-10-24 10:19:07,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:19:07,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:19:07,021 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:19:07,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:19:07,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:06" (1/1) ... [2024-10-24 10:19:07,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:19:07,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:19:07,048 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:19:07,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:19:07,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:19:07,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:19:07,088 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:19:07,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:19:07,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:19:07,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:19:07,152 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:19:07,154 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:19:07,298 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 10:19:07,298 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:19:07,347 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:19:07,347 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:19:07,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:07 BoogieIcfgContainer [2024-10-24 10:19:07,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:19:07,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:19:07,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:19:07,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:19:07,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:19:06" (1/3) ... [2024-10-24 10:19:07,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9581ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:19:07, skipping insertion in model container [2024-10-24 10:19:07,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:06" (2/3) ... [2024-10-24 10:19:07,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9581ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:19:07, skipping insertion in model container [2024-10-24 10:19:07,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:07" (3/3) ... [2024-10-24 10:19:07,355 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-38.i [2024-10-24 10:19:07,369 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:19:07,369 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:19:07,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:19:07,425 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;@3a1b2410, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:19:07,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:19:07,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 10:19:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 10:19:07,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:07,435 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:19:07,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:07,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:07,440 INFO L85 PathProgramCache]: Analyzing trace with hash -263418443, now seen corresponding path program 1 times [2024-10-24 10:19:07,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:19:07,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87321692] [2024-10-24 10:19:07,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:07,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:19:07,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:19:07,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:19:07,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 10:19:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:07,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 10:19:07,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:19:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 10:19:07,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:19:07,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:19:07,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87321692] [2024-10-24 10:19:07,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87321692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:19:07,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:19:07,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:19:07,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831103958] [2024-10-24 10:19:07,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:19:07,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:19:07,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:19:07,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:19:07,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:19:07,726 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 10:19:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:19:07,754 INFO L93 Difference]: Finished difference Result 53 states and 86 transitions. [2024-10-24 10:19:07,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:19:07,758 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2024-10-24 10:19:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:19:07,763 INFO L225 Difference]: With dead ends: 53 [2024-10-24 10:19:07,763 INFO L226 Difference]: Without dead ends: 26 [2024-10-24 10:19:07,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:19:07,768 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:19:07,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:19:07,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-24 10:19:07,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-24 10:19:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 10:19:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2024-10-24 10:19:07,794 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 51 [2024-10-24 10:19:07,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:19:07,794 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2024-10-24 10:19:07,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 10:19:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-10-24 10:19:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 10:19:07,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:07,797 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:19:07,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 10:19:07,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:19:07,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:07,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:07,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1736276337, now seen corresponding path program 1 times [2024-10-24 10:19:07,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:19:07,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284439575] [2024-10-24 10:19:07,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:07,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:19:08,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:19:08,002 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:19:08,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 10:19:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:08,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 10:19:08,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:19:08,227 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:19:08,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:19:08,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:19:08,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284439575] [2024-10-24 10:19:08,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284439575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:19:08,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:19:08,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:19:08,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686878366] [2024-10-24 10:19:08,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:19:08,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:19:08,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:19:08,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:19:08,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:19:08,231 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:19:08,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:19:08,302 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2024-10-24 10:19:08,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:19:08,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 51 [2024-10-24 10:19:08,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:19:08,303 INFO L225 Difference]: With dead ends: 43 [2024-10-24 10:19:08,303 INFO L226 Difference]: Without dead ends: 41 [2024-10-24 10:19:08,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:19:08,305 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 27 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:19:08,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 112 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:19:08,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-24 10:19:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-10-24 10:19:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 10:19:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2024-10-24 10:19:08,312 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 51 [2024-10-24 10:19:08,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:19:08,313 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2024-10-24 10:19:08,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:19:08,314 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2024-10-24 10:19:08,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 10:19:08,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:08,317 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:19:08,326 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-10-24 10:19:08,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:19:08,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:08,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:08,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2018963012, now seen corresponding path program 1 times [2024-10-24 10:19:08,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:19:08,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891751171] [2024-10-24 10:19:08,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:08,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:19:08,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:19:08,521 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:19:08,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 10:19:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:08,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 10:19:08,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:19:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 10:19:09,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:19:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-24 10:19:09,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:19:09,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891751171] [2024-10-24 10:19:09,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891751171] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 10:19:09,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 10:19:09,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-24 10:19:09,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309170677] [2024-10-24 10:19:09,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 10:19:09,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 10:19:09,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:19:09,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 10:19:09,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-24 10:19:09,306 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-24 10:19:10,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:19:10,128 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2024-10-24 10:19:10,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 10:19:10,129 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 52 [2024-10-24 10:19:10,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:19:10,130 INFO L225 Difference]: With dead ends: 61 [2024-10-24 10:19:10,130 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 10:19:10,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=236, Invalid=520, Unknown=0, NotChecked=0, Total=756 [2024-10-24 10:19:10,131 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 37 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 10:19:10,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 120 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 10:19:10,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 10:19:10,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 10:19:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 10:19:10,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 10:19:10,132 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2024-10-24 10:19:10,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:19:10,132 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 10:19:10,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-24 10:19:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 10:19:10,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 10:19:10,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:19:10,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 10:19:10,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:19:10,338 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 10:19:10,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 10:19:10,900 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:19:10,909 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:19:10,910 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:19:10,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:19:10,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:19:10,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:19:10,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:19:10,917 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:19:10,917 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:19:10,918 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:19:10,918 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:19:10,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:19:10 BoogieIcfgContainer [2024-10-24 10:19:10,924 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:19:10,925 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:19:10,925 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:19:10,925 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:19:10,927 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:07" (3/4) ... [2024-10-24 10:19:10,929 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 10:19:10,932 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 10:19:10,934 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-24 10:19:10,934 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-24 10:19:10,935 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 10:19:10,935 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 10:19:11,024 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 10:19:11,024 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 10:19:11,024 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:19:11,025 INFO L158 Benchmark]: Toolchain (without parser) took 4384.32ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 50.1MB in the beginning and 63.9MB in the end (delta: -13.8MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2024-10-24 10:19:11,025 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory is still 37.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:19:11,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.01ms. Allocated memory is still 75.5MB. Free memory was 49.9MB in the beginning and 36.2MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:19:11,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.93ms. Allocated memory is still 75.5MB. Free memory was 36.2MB in the beginning and 56.0MB in the end (delta: -19.8MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2024-10-24 10:19:11,025 INFO L158 Benchmark]: Boogie Preprocessor took 48.06ms. Allocated memory is still 75.5MB. Free memory was 56.0MB in the beginning and 53.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:19:11,025 INFO L158 Benchmark]: RCFGBuilder took 327.40ms. Allocated memory is still 75.5MB. Free memory was 53.5MB in the beginning and 38.1MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:19:11,029 INFO L158 Benchmark]: TraceAbstraction took 3573.43ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 37.5MB in the beginning and 68.9MB in the end (delta: -31.4MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-10-24 10:19:11,029 INFO L158 Benchmark]: Witness Printer took 99.67ms. Allocated memory is still 92.3MB. Free memory was 68.9MB in the beginning and 63.9MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 10:19:11,031 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.18ms. Allocated memory is still 54.5MB. Free memory is still 37.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.01ms. Allocated memory is still 75.5MB. Free memory was 49.9MB in the beginning and 36.2MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.93ms. Allocated memory is still 75.5MB. Free memory was 36.2MB in the beginning and 56.0MB in the end (delta: -19.8MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.06ms. Allocated memory is still 75.5MB. Free memory was 56.0MB in the beginning and 53.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 327.40ms. Allocated memory is still 75.5MB. Free memory was 53.5MB in the beginning and 38.1MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3573.43ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 37.5MB in the beginning and 68.9MB in the end (delta: -31.4MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * Witness Printer took 99.67ms. Allocated memory is still 92.3MB. Free memory was 68.9MB in the beginning and 63.9MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - 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: ~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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 3, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 263 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 299 IncrementalHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 107 mSDtfsCounter, 299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=2, InterpolantAutomatonStates: 25, 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 623 SizeOfPredicates, 16 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 417/448 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: 65]: 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_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8)))) RESULT: Ultimate proved your program to be correct! [2024-10-24 10:19:11,054 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