./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.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 cca63c3e90b93de3596db2b592e4b15f16483114c2aa2d051423728d02c52eb6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:30:08,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:30:08,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:30:08,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:30:08,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:30:08,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:30:08,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:30:08,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:30:08,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:30:08,847 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:30:08,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:30:08,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:30:08,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:30:08,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:30:08,849 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:30:08,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:30:08,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:30:08,850 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:30:08,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:30:08,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:30:08,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:30:08,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:30:08,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:30:08,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:30:08,856 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:30:08,857 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:30:08,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:30:08,857 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:30:08,858 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:30:08,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:30:08,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:30:08,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:30:08,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:30:08,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:30:08,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:30:08,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:30:08,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:30:08,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:30:08,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:30:08,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:30:08,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:30:08,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:30:08,868 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 -> cca63c3e90b93de3596db2b592e4b15f16483114c2aa2d051423728d02c52eb6 [2024-11-12 06:30:09,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:30:09,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:30:09,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:30:09,180 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:30:09,181 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:30:09,182 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i [2024-11-12 06:30:10,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:30:11,169 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:30:11,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i [2024-11-12 06:30:11,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/125eccb32/515b943c19ad4e559ece5123fb7ea6e8/FLAGd73d35840 [2024-11-12 06:30:11,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/125eccb32/515b943c19ad4e559ece5123fb7ea6e8 [2024-11-12 06:30:11,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:30:11,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:30:11,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:30:11,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:30:11,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:30:11,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:30:11" (1/1) ... [2024-11-12 06:30:11,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5850cf78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:11, skipping insertion in model container [2024-11-12 06:30:11,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:30:11" (1/1) ... [2024-11-12 06:30:11,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:30:11,412 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i[915,928] [2024-11-12 06:30:11,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:30:11,499 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:30:11,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i[915,928] [2024-11-12 06:30:11,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:30:11,554 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:30:11,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:11 WrapperNode [2024-11-12 06:30:11,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:30:11,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:30:11,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:30:11,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:30:11,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:11" (1/1) ... [2024-11-12 06:30:11,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:11" (1/1) ... [2024-11-12 06:30:11,636 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-11-12 06:30:11,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:30:11,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:30:11,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:30:11,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:30:11,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:11" (1/1) ... [2024-11-12 06:30:11,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:11" (1/1) ... [2024-11-12 06:30:11,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:11" (1/1) ... [2024-11-12 06:30:11,700 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:30:11,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:11" (1/1) ... [2024-11-12 06:30:11,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:11" (1/1) ... [2024-11-12 06:30:11,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:11" (1/1) ... [2024-11-12 06:30:11,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:11" (1/1) ... [2024-11-12 06:30:11,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:11" (1/1) ... [2024-11-12 06:30:11,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:11" (1/1) ... [2024-11-12 06:30:11,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:30:11,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:30:11,730 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:30:11,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:30:11,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:11" (1/1) ... [2024-11-12 06:30:11,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:30:11,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:30:11,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:30:11,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:30:11,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:30:11,839 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:30:11,840 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:30:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:30:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:30:11,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:30:11,932 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:30:11,943 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:30:12,236 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-12 06:30:12,237 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:30:12,251 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:30:12,251 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:30:12,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:30:12 BoogieIcfgContainer [2024-11-12 06:30:12,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:30:12,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:30:12,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:30:12,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:30:12,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:30:11" (1/3) ... [2024-11-12 06:30:12,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ed60ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:30:12, skipping insertion in model container [2024-11-12 06:30:12,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:11" (2/3) ... [2024-11-12 06:30:12,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ed60ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:30:12, skipping insertion in model container [2024-11-12 06:30:12,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:30:12" (3/3) ... [2024-11-12 06:30:12,262 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-54.i [2024-11-12 06:30:12,280 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:30:12,280 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:30:12,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:30:12,419 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;@641251a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:30:12,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:30:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 06:30:12,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-12 06:30:12,432 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:30:12,433 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:30:12,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:30:12,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:30:12,442 INFO L85 PathProgramCache]: Analyzing trace with hash 345523466, now seen corresponding path program 1 times [2024-11-12 06:30:12,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:30:12,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881452988] [2024-11-12 06:30:12,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:30:12,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:30:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:12,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:30:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:12,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:30:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:12,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:30:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:12,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:30:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:12,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:30:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:12,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:30:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:12,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:30:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:12,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:30:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:12,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:30:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:12,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:30:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:12,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:30:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 06:30:12,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:30:12,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881452988] [2024-11-12 06:30:12,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881452988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:30:12,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:30:12,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:30:12,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033697875] [2024-11-12 06:30:12,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:30:12,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:30:12,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:30:12,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:30:12,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:30:12,948 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 06:30:12,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:30:12,975 INFO L93 Difference]: Finished difference Result 77 states and 123 transitions. [2024-11-12 06:30:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:30:12,981 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 75 [2024-11-12 06:30:12,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:30:12,989 INFO L225 Difference]: With dead ends: 77 [2024-11-12 06:30:12,989 INFO L226 Difference]: Without dead ends: 38 [2024-11-12 06:30:12,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:30:13,001 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:30:13,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:30:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-12 06:30:13,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-12 06:30:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 06:30:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2024-11-12 06:30:13,056 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 75 [2024-11-12 06:30:13,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:30:13,058 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2024-11-12 06:30:13,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 06:30:13,058 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2024-11-12 06:30:13,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-12 06:30:13,062 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:30:13,063 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:30:13,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:30:13,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:30:13,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:30:13,068 INFO L85 PathProgramCache]: Analyzing trace with hash -812801714, now seen corresponding path program 1 times [2024-11-12 06:30:13,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:30:13,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80634431] [2024-11-12 06:30:13,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:30:13,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:30:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:13,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:30:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:13,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:30:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:13,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:30:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:13,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:30:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:13,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:30:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:13,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:30:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:13,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:30:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:13,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:30:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:13,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:30:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:13,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:30:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:13,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:30:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 06:30:13,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:30:13,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80634431] [2024-11-12 06:30:13,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80634431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:30:13,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:30:13,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:30:13,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631145082] [2024-11-12 06:30:13,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:30:13,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:30:13,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:30:13,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:30:13,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:30:13,505 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 06:30:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:30:13,586 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2024-11-12 06:30:13,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:30:13,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 75 [2024-11-12 06:30:13,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:30:13,588 INFO L225 Difference]: With dead ends: 75 [2024-11-12 06:30:13,589 INFO L226 Difference]: Without dead ends: 40 [2024-11-12 06:30:13,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:30:13,593 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 14 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:30:13,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:30:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-12 06:30:13,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-12 06:30:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 06:30:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-12 06:30:13,608 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 75 [2024-11-12 06:30:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:30:13,612 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-12 06:30:13,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 06:30:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-12 06:30:13,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-12 06:30:13,618 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:30:13,619 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:30:13,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:30:13,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:30:13,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:30:13,620 INFO L85 PathProgramCache]: Analyzing trace with hash 962205648, now seen corresponding path program 1 times [2024-11-12 06:30:13,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:30:13,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014964241] [2024-11-12 06:30:13,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:30:13,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:30:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:30:13,727 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:30:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:30:13,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:30:13,848 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:30:13,849 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:30:13,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:30:13,855 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 06:30:13,917 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:30:13,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:30:13 BoogieIcfgContainer [2024-11-12 06:30:13,921 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:30:13,922 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:30:13,922 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:30:13,922 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:30:13,923 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:30:12" (3/4) ... [2024-11-12 06:30:13,926 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:30:13,927 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:30:13,928 INFO L158 Benchmark]: Toolchain (without parser) took 2721.97ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 50.9MB in the end (delta: 59.3MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2024-11-12 06:30:13,931 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 130.8MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:30:13,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.50ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 95.6MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 06:30:13,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.42ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 92.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:30:13,932 INFO L158 Benchmark]: Boogie Preprocessor took 91.35ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 89.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 06:30:13,932 INFO L158 Benchmark]: RCFGBuilder took 521.66ms. Allocated memory is still 167.8MB. Free memory was 89.1MB in the beginning and 72.5MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 06:30:13,932 INFO L158 Benchmark]: TraceAbstraction took 1667.38ms. Allocated memory is still 167.8MB. Free memory was 72.1MB in the beginning and 52.1MB in the end (delta: 19.9MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-11-12 06:30:13,933 INFO L158 Benchmark]: Witness Printer took 5.16ms. Allocated memory is still 167.8MB. Free memory was 51.8MB in the beginning and 50.9MB in the end (delta: 902.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:30:13,939 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.27ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 130.8MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.50ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 95.6MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.42ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 92.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.35ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 89.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 521.66ms. Allocated memory is still 167.8MB. Free memory was 89.1MB in the beginning and 72.5MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1667.38ms. Allocated memory is still 167.8MB. Free memory was 72.1MB in the beginning and 52.1MB in the end (delta: 19.9MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Witness Printer took 5.16ms. Allocated memory is still 167.8MB. Free memory was 51.8MB in the beginning and 50.9MB in the end (delta: 902.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_3 = 10; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 0; [L28] unsigned long int var_1_9 = 5; [L29] unsigned long int var_1_10 = 3126062476; [L30] unsigned short int var_1_13 = 10; [L31] signed long int var_1_14 = 128; [L32] float var_1_15 = 4.2; [L33] float var_1_16 = 5.1; VAL [isInitial=0, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=10, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] FCALL updateLastVariables() [L89] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L62] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L62] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L63] var_1_6 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_7=0, var_1_8=0, var_1_9=5] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_7=0, var_1_8=0, var_1_9=5] [L65] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L65] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L66] var_1_7 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_8=0, var_1_9=5] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_8=0, var_1_9=5] [L68] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L68] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L69] var_1_8 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_9=5] [L70] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_9=5] [L71] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L71] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L72] var_1_10 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_10 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L73] RET assume_abort_if_not(var_1_10 >= 2147483647) VAL [isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L74] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L74] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L75] var_1_16 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L76] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L89] RET updateVariables() [L90] CALL step() [L37] var_1_13 = var_1_3 [L38] var_1_14 = var_1_3 [L39] var_1_15 = var_1_16 [L40] unsigned short int stepLocal_0 = var_1_13; VAL [isInitial=1, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L41] COND FALSE !(-4 >= stepLocal_0) VAL [isInitial=1, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L44] signed long int stepLocal_2 = var_1_14; VAL [isInitial=1, stepLocal_2=254, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L45] COND FALSE !(var_1_3 < stepLocal_2) VAL [isInitial=1, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L48] unsigned long int stepLocal_1 = 8 * var_1_9; VAL [isInitial=1, stepLocal_1=40, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L49] COND FALSE !(stepLocal_1 == ((((10) > (var_1_9)) ? (10) : (var_1_9)))) [L56] var_1_4 = var_1_8 VAL [isInitial=1, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L90] RET step() [L91] CALL, EXPR property() [L81-L82] return ((((((-4 >= var_1_13) ? (var_1_1 == ((unsigned char) ((((var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * var_1_9) == ((((10) > (var_1_9)) ? (10) : (var_1_9)))) ? (var_1_6 ? (var_1_4 == ((unsigned char) (var_1_7 && var_1_8))) : (var_1_4 == ((unsigned char) var_1_8))) : (var_1_4 == ((unsigned char) var_1_8)))) && ((var_1_3 < var_1_14) ? (var_1_9 == ((unsigned long int) (((((3851651024u - var_1_3)) < ((((((var_1_10 - var_1_13)) > ((var_1_1 + var_1_1))) ? ((var_1_10 - var_1_13)) : ((var_1_1 + var_1_1)))))) ? ((3851651024u - var_1_3)) : ((((((var_1_10 - var_1_13)) > ((var_1_1 + var_1_1))) ? ((var_1_10 - var_1_13)) : ((var_1_1 + var_1_1))))))))) : 1)) && (var_1_13 == ((unsigned short int) var_1_3))) && (var_1_14 == ((signed long int) var_1_3))) && (var_1_15 == ((float) var_1_16)) ; VAL [\result=0, isInitial=1, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L19] reach_error() VAL [isInitial=1, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 176 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 100 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 440/440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 06:30:13,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.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 cca63c3e90b93de3596db2b592e4b15f16483114c2aa2d051423728d02c52eb6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:30:16,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:30:16,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:30:16,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:30:16,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:30:16,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:30:16,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:30:16,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:30:16,851 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:30:16,851 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:30:16,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:30:16,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:30:16,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:30:16,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:30:16,854 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:30:16,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:30:16,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:30:16,858 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:30:16,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:30:16,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:30:16,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:30:16,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:30:16,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:30:16,863 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:30:16,864 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:30:16,864 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:30:16,864 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:30:16,865 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:30:16,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:30:16,865 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:30:16,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:30:16,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:30:16,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:30:16,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:30:16,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:30:16,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:30:16,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:30:16,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:30:16,872 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:30:16,872 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:30:16,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:30:16,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:30:16,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:30:16,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:30:16,873 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 -> cca63c3e90b93de3596db2b592e4b15f16483114c2aa2d051423728d02c52eb6 [2024-11-12 06:30:17,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:30:17,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:30:17,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:30:17,337 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:30:17,338 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:30:17,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i [2024-11-12 06:30:19,247 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:30:19,499 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:30:19,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i [2024-11-12 06:30:19,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc06ad647/b6c6cb7ca44a486bb7e6af589c57f33b/FLAG89558b51d [2024-11-12 06:30:19,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc06ad647/b6c6cb7ca44a486bb7e6af589c57f33b [2024-11-12 06:30:19,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:30:19,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:30:19,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:30:19,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:30:19,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:30:19,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:30:19" (1/1) ... [2024-11-12 06:30:19,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5b66ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:19, skipping insertion in model container [2024-11-12 06:30:19,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:30:19" (1/1) ... [2024-11-12 06:30:19,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:30:20,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i[915,928] [2024-11-12 06:30:20,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:30:20,184 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:30:20,201 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i[915,928] [2024-11-12 06:30:20,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:30:20,264 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:30:20,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:20 WrapperNode [2024-11-12 06:30:20,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:30:20,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:30:20,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:30:20,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:30:20,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:20" (1/1) ... [2024-11-12 06:30:20,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:20" (1/1) ... [2024-11-12 06:30:20,325 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-11-12 06:30:20,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:30:20,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:30:20,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:30:20,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:30:20,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:20" (1/1) ... [2024-11-12 06:30:20,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:20" (1/1) ... [2024-11-12 06:30:20,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:20" (1/1) ... [2024-11-12 06:30:20,369 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:30:20,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:20" (1/1) ... [2024-11-12 06:30:20,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:20" (1/1) ... [2024-11-12 06:30:20,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:20" (1/1) ... [2024-11-12 06:30:20,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:20" (1/1) ... [2024-11-12 06:30:20,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:20" (1/1) ... [2024-11-12 06:30:20,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:20" (1/1) ... [2024-11-12 06:30:20,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:30:20,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:30:20,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:30:20,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:30:20,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:20" (1/1) ... [2024-11-12 06:30:20,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:30:20,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:30:20,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:30:20,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:30:20,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:30:20,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:30:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:30:20,528 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:30:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:30:20,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:30:20,637 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:30:20,639 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:30:20,851 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-12 06:30:20,851 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:30:20,868 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:30:20,869 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:30:20,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:30:20 BoogieIcfgContainer [2024-11-12 06:30:20,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:30:20,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:30:20,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:30:20,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:30:20,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:30:19" (1/3) ... [2024-11-12 06:30:20,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b47ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:30:20, skipping insertion in model container [2024-11-12 06:30:20,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:20" (2/3) ... [2024-11-12 06:30:20,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b47ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:30:20, skipping insertion in model container [2024-11-12 06:30:20,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:30:20" (3/3) ... [2024-11-12 06:30:20,878 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-54.i [2024-11-12 06:30:20,896 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:30:20,896 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:30:20,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:30:20,974 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;@371e4690, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:30:20,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:30:20,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 06:30:20,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-12 06:30:20,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:30:20,991 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:30:20,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:30:21,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:30:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash 345523466, now seen corresponding path program 1 times [2024-11-12 06:30:21,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:30:21,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922521355] [2024-11-12 06:30:21,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:30:21,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:30:21,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:30:21,028 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:30:21,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 06:30:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:21,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:30:21,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:30:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-12 06:30:21,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:30:21,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:30:21,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922521355] [2024-11-12 06:30:21,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922521355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:30:21,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:30:21,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:30:21,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667514989] [2024-11-12 06:30:21,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:30:21,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:30:21,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:30:21,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:30:21,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:30:21,386 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 06:30:21,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:30:21,409 INFO L93 Difference]: Finished difference Result 77 states and 123 transitions. [2024-11-12 06:30:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:30:21,411 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 75 [2024-11-12 06:30:21,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:30:21,417 INFO L225 Difference]: With dead ends: 77 [2024-11-12 06:30:21,417 INFO L226 Difference]: Without dead ends: 38 [2024-11-12 06:30:21,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:30:21,424 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:30:21,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:30:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-12 06:30:21,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-12 06:30:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 06:30:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2024-11-12 06:30:21,464 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 75 [2024-11-12 06:30:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:30:21,464 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2024-11-12 06:30:21,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 06:30:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2024-11-12 06:30:21,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-12 06:30:21,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:30:21,469 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:30:21,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 06:30:21,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:30:21,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:30:21,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:30:21,672 INFO L85 PathProgramCache]: Analyzing trace with hash -812801714, now seen corresponding path program 1 times [2024-11-12 06:30:21,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:30:21,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617176017] [2024-11-12 06:30:21,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:30:21,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:30:21,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:30:21,678 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:30:21,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 06:30:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:21,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 06:30:21,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:30:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 06:30:21,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:30:21,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:30:21,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617176017] [2024-11-12 06:30:21,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617176017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:30:21,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:30:21,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:30:21,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357753962] [2024-11-12 06:30:21,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:30:21,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:30:21,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:30:21,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:30:21,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:30:21,980 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 06:30:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:30:22,034 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2024-11-12 06:30:22,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:30:22,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 75 [2024-11-12 06:30:22,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:30:22,036 INFO L225 Difference]: With dead ends: 75 [2024-11-12 06:30:22,036 INFO L226 Difference]: Without dead ends: 40 [2024-11-12 06:30:22,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:30:22,037 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 14 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:30:22,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 123 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:30:22,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-12 06:30:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-12 06:30:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 06:30:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-12 06:30:22,045 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 75 [2024-11-12 06:30:22,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:30:22,047 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-12 06:30:22,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 06:30:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-12 06:30:22,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-12 06:30:22,048 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:30:22,048 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:30:22,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 06:30:22,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:30:22,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:30:22,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:30:22,252 INFO L85 PathProgramCache]: Analyzing trace with hash 962205648, now seen corresponding path program 1 times [2024-11-12 06:30:22,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:30:22,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066784305] [2024-11-12 06:30:22,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:30:22,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:30:22,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:30:22,258 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:30:22,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 06:30:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:22,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 06:30:22,479 INFO L279 TraceCheckSpWp]: Computing forward predicates...