./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-10.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 74209841f9356d49f7572acf5bfcaf3e4678665a116185553a2345eed5aa500b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:50:01,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:50:01,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 23:50:01,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:50:01,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:50:01,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:50:01,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:50:01,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:50:01,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:50:01,700 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:50:01,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:50:01,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:50:01,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:50:01,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:50:01,704 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:50:01,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:50:01,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:50:01,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:50:01,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 23:50:01,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:50:01,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:50:01,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:50:01,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:50:01,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:50:01,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:50:01,711 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:50:01,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:50:01,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:50:01,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:50:01,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:50:01,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:50:01,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:50:01,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:50:01,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:50:01,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:50:01,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:50:01,713 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 23:50:01,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 23:50:01,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:50:01,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:50:01,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:50:01,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:50:01,716 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 -> 74209841f9356d49f7572acf5bfcaf3e4678665a116185553a2345eed5aa500b [2024-11-18 23:50:01,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:50:02,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:50:02,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:50:02,021 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:50:02,021 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:50:02,022 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-10.i [2024-11-18 23:50:03,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:50:03,670 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:50:03,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-10.i [2024-11-18 23:50:03,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1547d929c/daaefca626ed4a57899c866950086d2f/FLAG9161ad4de [2024-11-18 23:50:03,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1547d929c/daaefca626ed4a57899c866950086d2f [2024-11-18 23:50:03,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:50:03,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:50:03,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:50:03,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:50:03,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:50:03,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:50:03" (1/1) ... [2024-11-18 23:50:03,717 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3320e0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:03, skipping insertion in model container [2024-11-18 23:50:03,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:50:03" (1/1) ... [2024-11-18 23:50:03,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:50:03,913 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-10.i[915,928] [2024-11-18 23:50:03,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:50:03,962 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:50:03,974 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-10.i[915,928] [2024-11-18 23:50:03,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:50:04,011 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:50:04,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:04 WrapperNode [2024-11-18 23:50:04,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:50:04,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:50:04,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:50:04,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:50:04,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:04" (1/1) ... [2024-11-18 23:50:04,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:04" (1/1) ... [2024-11-18 23:50:04,056 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-18 23:50:04,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:50:04,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:50:04,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:50:04,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:50:04,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:04" (1/1) ... [2024-11-18 23:50:04,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:04" (1/1) ... [2024-11-18 23:50:04,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:04" (1/1) ... [2024-11-18 23:50:04,087 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-18 23:50:04,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:04" (1/1) ... [2024-11-18 23:50:04,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:04" (1/1) ... [2024-11-18 23:50:04,094 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:04" (1/1) ... [2024-11-18 23:50:04,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:04" (1/1) ... [2024-11-18 23:50:04,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:04" (1/1) ... [2024-11-18 23:50:04,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:04" (1/1) ... [2024-11-18 23:50:04,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:50:04,109 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:50:04,109 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:50:04,109 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:50:04,110 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:04" (1/1) ... [2024-11-18 23:50:04,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:50:04,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:50:04,156 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-18 23:50:04,159 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-18 23:50:04,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:50:04,206 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:50:04,207 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:50:04,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 23:50:04,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:50:04,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:50:04,310 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:50:04,312 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:50:04,632 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-18 23:50:04,632 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:50:04,659 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:50:04,660 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:50:04,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:50:04 BoogieIcfgContainer [2024-11-18 23:50:04,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:50:04,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:50:04,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:50:04,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:50:04,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:50:03" (1/3) ... [2024-11-18 23:50:04,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6683e535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:50:04, skipping insertion in model container [2024-11-18 23:50:04,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:04" (2/3) ... [2024-11-18 23:50:04,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6683e535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:50:04, skipping insertion in model container [2024-11-18 23:50:04,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:50:04" (3/3) ... [2024-11-18 23:50:04,669 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-10.i [2024-11-18 23:50:04,682 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:50:04,682 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:50:04,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:50:04,751 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;@7f2dbef4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:50:04,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:50:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-18 23:50:04,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-18 23:50:04,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:50:04,767 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:50:04,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:50:04,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:50:04,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1597969553, now seen corresponding path program 1 times [2024-11-18 23:50:04,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:50:04,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953291385] [2024-11-18 23:50:04,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:50:04,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:50:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:50:05,101 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-18 23:50:05,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:50:05,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953291385] [2024-11-18 23:50:05,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953291385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:50:05,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541981596] [2024-11-18 23:50:05,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:50:05,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:50:05,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:50:05,107 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 23:50:05,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 23:50:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:50:05,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:50:05,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:50:05,321 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-18 23:50:05,324 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:50:05,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541981596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:50:05,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:50:05,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 23:50:05,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814254913] [2024-11-18 23:50:05,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:50:05,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:50:05,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:50:05,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:50:05,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:50:05,352 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-18 23:50:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:50:05,377 INFO L93 Difference]: Finished difference Result 97 states and 161 transitions. [2024-11-18 23:50:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:50:05,379 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2024-11-18 23:50:05,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:50:05,384 INFO L225 Difference]: With dead ends: 97 [2024-11-18 23:50:05,384 INFO L226 Difference]: Without dead ends: 48 [2024-11-18 23:50:05,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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-18 23:50:05,391 INFO L432 NwaCegarLoop]: 68 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, 68 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-18 23:50:05,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:50:05,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-18 23:50:05,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-18 23:50:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-18 23:50:05,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2024-11-18 23:50:05,440 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 108 [2024-11-18 23:50:05,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:50:05,440 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2024-11-18 23:50:05,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-18 23:50:05,441 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2024-11-18 23:50:05,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-18 23:50:05,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:50:05,446 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:50:05,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 23:50:05,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 23:50:05,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:50:05,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:50:05,648 INFO L85 PathProgramCache]: Analyzing trace with hash 648405507, now seen corresponding path program 1 times [2024-11-18 23:50:05,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:50:05,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881428094] [2024-11-18 23:50:05,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:50:05,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:50:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:50:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-18 23:50:06,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:50:06,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881428094] [2024-11-18 23:50:06,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881428094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:50:06,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:50:06,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:50:06,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599320362] [2024-11-18 23:50:06,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:50:06,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:50:06,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:50:06,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:50:06,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:50:06,185 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-18 23:50:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:50:06,223 INFO L93 Difference]: Finished difference Result 93 states and 133 transitions. [2024-11-18 23:50:06,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:50:06,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-18 23:50:06,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:50:06,227 INFO L225 Difference]: With dead ends: 93 [2024-11-18 23:50:06,228 INFO L226 Difference]: Without dead ends: 48 [2024-11-18 23:50:06,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:50:06,231 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:50:06,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:50:06,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-18 23:50:06,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-18 23:50:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-18 23:50:06,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2024-11-18 23:50:06,246 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 108 [2024-11-18 23:50:06,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:50:06,250 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2024-11-18 23:50:06,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-18 23:50:06,251 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2024-11-18 23:50:06,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-18 23:50:06,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:50:06,254 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:50:06,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 23:50:06,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:50:06,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:50:06,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1320763996, now seen corresponding path program 1 times [2024-11-18 23:50:06,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:50:06,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967740778] [2024-11-18 23:50:06,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:50:06,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:50:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 23:50:06,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1327536866] [2024-11-18 23:50:06,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:50:06,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:50:06,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:50:06,368 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 23:50:06,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 23:50:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:50:06,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 23:50:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:50:06,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 23:50:06,682 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 23:50:06,685 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 23:50:06,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 23:50:06,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-18 23:50:06,891 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-18 23:50:06,978 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 23:50:06,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:50:06 BoogieIcfgContainer [2024-11-18 23:50:06,981 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 23:50:06,982 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 23:50:06,982 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 23:50:06,982 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 23:50:06,983 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:50:04" (3/4) ... [2024-11-18 23:50:06,985 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 23:50:06,986 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 23:50:06,986 INFO L158 Benchmark]: Toolchain (without parser) took 3280.33ms. Allocated memory was 157.3MB in the beginning and 209.7MB in the end (delta: 52.4MB). Free memory was 101.3MB in the beginning and 167.8MB in the end (delta: -66.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:50:06,986 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 157.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:50:06,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.64ms. Allocated memory is still 157.3MB. Free memory was 101.0MB in the beginning and 86.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 23:50:06,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.48ms. Allocated memory is still 157.3MB. Free memory was 86.7MB in the beginning and 84.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 23:50:06,988 INFO L158 Benchmark]: Boogie Preprocessor took 50.66ms. Allocated memory is still 157.3MB. Free memory was 84.1MB in the beginning and 81.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 23:50:06,988 INFO L158 Benchmark]: RCFGBuilder took 551.73ms. Allocated memory was 157.3MB in the beginning and 209.7MB in the end (delta: 52.4MB). Free memory was 81.2MB in the beginning and 179.8MB in the end (delta: -98.7MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-11-18 23:50:06,988 INFO L158 Benchmark]: TraceAbstraction took 2318.65ms. Allocated memory is still 209.7MB. Free memory was 178.8MB in the beginning and 167.8MB in the end (delta: 11.0MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. [2024-11-18 23:50:06,989 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 209.7MB. Free memory is still 167.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:50:06,994 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 157.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.64ms. Allocated memory is still 157.3MB. Free memory was 101.0MB in the beginning and 86.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.48ms. Allocated memory is still 157.3MB. Free memory was 86.7MB in the beginning and 84.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.66ms. Allocated memory is still 157.3MB. Free memory was 84.1MB in the beginning and 81.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 551.73ms. Allocated memory was 157.3MB in the beginning and 209.7MB in the end (delta: 52.4MB). Free memory was 81.2MB in the beginning and 179.8MB in the end (delta: -98.7MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2318.65ms. Allocated memory is still 209.7MB. Free memory was 178.8MB in the beginning and 167.8MB in the end (delta: 11.0MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 209.7MB. Free memory is still 167.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_2 = 8; [L24] double var_1_3 = 9.15; [L25] double var_1_6 = 1000000.875; [L26] double var_1_7 = 49.25; [L27] double var_1_8 = 1000000000.8; [L28] double var_1_9 = 7.85; [L29] double var_1_10 = 15.5; [L30] double var_1_11 = 49.875; [L31] unsigned char var_1_12 = 4; [L32] unsigned char var_1_13 = 0; [L33] unsigned short int var_1_14 = 42290; [L34] unsigned short int var_1_15 = 2; [L35] unsigned char var_1_16 = 32; [L36] double var_1_17 = 64.4; [L37] signed long int var_1_18 = 0; [L38] signed char var_1_19 = -1; VAL [isInitial=0, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=8, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_ulong() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L70] CALL assume_abort_if_not(var_1_2 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L70] RET assume_abort_if_not(var_1_2 <= 4294967294) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L71] var_1_6 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L72] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L73] var_1_7 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_8=5000000004/5, var_1_9=157/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_8=5000000004/5, var_1_9=157/20] [L74] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_8=5000000004/5, var_1_9=157/20] [L75] var_1_8 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_9=157/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_9=157/20] [L76] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_9=157/20] [L77] var_1_9 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L78] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L79] var_1_10 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L80] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L81] var_1_11 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L82] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L83] var_1_13 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L84] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=4, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L85] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L85] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L86] var_1_14 = __VERIFIER_nondet_ushort() [L87] CALL assume_abort_if_not(var_1_14 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L87] RET assume_abort_if_not(var_1_14 >= 32767) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L88] CALL assume_abort_if_not(var_1_14 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L88] RET assume_abort_if_not(var_1_14 <= 65535) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L89] var_1_15 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L90] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L91] CALL assume_abort_if_not(var_1_15 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L91] RET assume_abort_if_not(var_1_15 <= 32766) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L92] CALL assume_abort_if_not(var_1_15 != 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L92] RET assume_abort_if_not(var_1_15 != 32767) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L93] var_1_16 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L94] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L95] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L95] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L108] RET updateVariables() [L109] CALL step() [L42] var_1_17 = (var_1_8 + var_1_9) [L43] var_1_18 = var_1_15 [L44] var_1_19 = 8 [L45] unsigned long int stepLocal_1 = var_1_2; VAL [isInitial=1, stepLocal_1=0, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_18=1, var_1_19=8, var_1_1=5, var_1_2=0, var_1_3=183/20] [L46] COND FALSE !(\read(var_1_13)) [L53] var_1_12 = var_1_16 VAL [isInitial=1, stepLocal_1=0, var_1_12=254, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_18=1, var_1_19=8, var_1_1=5, var_1_2=0, var_1_3=183/20] [L55] var_1_1 = var_1_12 [L56] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, stepLocal_0=254, stepLocal_1=0, var_1_12=254, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_18=1, var_1_19=8, var_1_1=254, var_1_2=0, var_1_3=183/20] [L57] COND FALSE !(stepLocal_0 < var_1_1) VAL [isInitial=1, stepLocal_1=0, var_1_12=254, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_18=1, var_1_19=8, var_1_1=254, var_1_2=0, var_1_3=183/20] [L60] COND TRUE (- var_1_17) == (var_1_6 - var_1_7) [L61] var_1_3 = (var_1_8 + (var_1_9 - ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))) VAL [isInitial=1, stepLocal_1=0, var_1_12=254, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_18=1, var_1_19=8, var_1_1=254, var_1_2=0] [L109] RET step() [L110] CALL, EXPR property() [L100-L101] return (((((var_1_1 == ((unsigned long int) var_1_12)) && ((var_1_12 < var_1_1) ? (var_1_3 == ((double) -0.5)) : (((- var_1_17) == (var_1_6 - var_1_7)) ? (var_1_3 == ((double) (var_1_8 + (var_1_9 - ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))))) : (var_1_3 == ((double) 50.125))))) && (var_1_13 ? (((var_1_18 / (var_1_14 - var_1_15)) <= var_1_2) ? (var_1_12 == ((unsigned char) var_1_16)) : (var_1_12 == ((unsigned char) 16))) : (var_1_12 == ((unsigned char) var_1_16)))) && (var_1_17 == ((double) (var_1_8 + var_1_9)))) && (var_1_18 == ((signed long int) var_1_15))) && (var_1_19 == ((signed char) 8)) ; VAL [\result=0, isInitial=1, var_1_12=254, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_18=1, var_1_19=8, var_1_1=254, var_1_2=0] [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_18=1, var_1_19=8, var_1_1=254, var_1_2=0] [L19] reach_error() VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_18=1, var_1_19=8, var_1_1=254, var_1_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 193 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 134 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 542 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 321 ConstructedInterpolants, 0 QuantifiedInterpolants, 346 SizeOfPredicates, 0 NumberOfNonLiveVariables, 253 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1600/1632 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-18 23:50:07,022 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-10.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 74209841f9356d49f7572acf5bfcaf3e4678665a116185553a2345eed5aa500b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:50:09,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:50:09,362 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 23:50:09,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:50:09,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:50:09,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:50:09,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:50:09,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:50:09,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:50:09,409 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:50:09,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:50:09,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:50:09,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:50:09,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:50:09,411 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:50:09,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:50:09,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:50:09,412 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:50:09,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:50:09,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:50:09,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:50:09,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:50:09,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:50:09,417 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 23:50:09,417 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 23:50:09,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:50:09,418 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 23:50:09,418 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:50:09,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:50:09,419 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:50:09,419 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:50:09,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:50:09,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:50:09,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:50:09,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:50:09,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:50:09,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:50:09,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:50:09,421 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 23:50:09,421 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 23:50:09,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:50:09,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:50:09,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:50:09,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:50:09,423 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 -> 74209841f9356d49f7572acf5bfcaf3e4678665a116185553a2345eed5aa500b [2024-11-18 23:50:09,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:50:09,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:50:09,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:50:09,808 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:50:09,808 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:50:09,810 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-10.i [2024-11-18 23:50:11,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:50:11,639 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:50:11,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-10.i [2024-11-18 23:50:11,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96712709e/ef052839d49e4f24b50c67796d428a33/FLAG64e865f12 [2024-11-18 23:50:11,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96712709e/ef052839d49e4f24b50c67796d428a33 [2024-11-18 23:50:11,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:50:11,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:50:11,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:50:11,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:50:11,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:50:11,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:50:11" (1/1) ... [2024-11-18 23:50:11,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398bf519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:11, skipping insertion in model container [2024-11-18 23:50:11,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:50:11" (1/1) ... [2024-11-18 23:50:11,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:50:11,914 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-10.i[915,928] [2024-11-18 23:50:11,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:50:11,988 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:50:12,002 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-10.i[915,928] [2024-11-18 23:50:12,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:50:12,053 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:50:12,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:12 WrapperNode [2024-11-18 23:50:12,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:50:12,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:50:12,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:50:12,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:50:12,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:12" (1/1) ... [2024-11-18 23:50:12,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:12" (1/1) ... [2024-11-18 23:50:12,113 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-18 23:50:12,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:50:12,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:50:12,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:50:12,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:50:12,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:12" (1/1) ... [2024-11-18 23:50:12,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:12" (1/1) ... [2024-11-18 23:50:12,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:12" (1/1) ... [2024-11-18 23:50:12,143 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-18 23:50:12,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:12" (1/1) ... [2024-11-18 23:50:12,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:12" (1/1) ... [2024-11-18 23:50:12,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:12" (1/1) ... [2024-11-18 23:50:12,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:12" (1/1) ... [2024-11-18 23:50:12,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:12" (1/1) ... [2024-11-18 23:50:12,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:12" (1/1) ... [2024-11-18 23:50:12,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:50:12,163 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:50:12,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:50:12,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:50:12,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:12" (1/1) ... [2024-11-18 23:50:12,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:50:12,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:50:12,204 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-18 23:50:12,208 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-18 23:50:12,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:50:12,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 23:50:12,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:50:12,247 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:50:12,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:50:12,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:50:12,330 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:50:12,334 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:50:15,990 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-18 23:50:15,990 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:50:16,004 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:50:16,004 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:50:16,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:50:16 BoogieIcfgContainer [2024-11-18 23:50:16,005 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:50:16,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:50:16,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:50:16,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:50:16,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:50:11" (1/3) ... [2024-11-18 23:50:16,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef19800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:50:16, skipping insertion in model container [2024-11-18 23:50:16,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:12" (2/3) ... [2024-11-18 23:50:16,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef19800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:50:16, skipping insertion in model container [2024-11-18 23:50:16,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:50:16" (3/3) ... [2024-11-18 23:50:16,015 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-10.i [2024-11-18 23:50:16,031 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:50:16,031 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:50:16,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:50:16,099 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;@16662a3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:50:16,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:50:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-18 23:50:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-18 23:50:16,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:50:16,115 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:50:16,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:50:16,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:50:16,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1597969553, now seen corresponding path program 1 times [2024-11-18 23:50:16,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:50:16,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975098922] [2024-11-18 23:50:16,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:50:16,133 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-18 23:50:16,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:50:16,137 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-18 23:50:16,138 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-18 23:50:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:50:16,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:50:16,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:50:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2024-11-18 23:50:16,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:50:16,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:50:16,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975098922] [2024-11-18 23:50:16,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975098922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:50:16,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:50:16,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 23:50:16,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930832322] [2024-11-18 23:50:16,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:50:16,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:50:16,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:50:16,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:50:16,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:50:16,637 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-18 23:50:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:50:16,660 INFO L93 Difference]: Finished difference Result 97 states and 161 transitions. [2024-11-18 23:50:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:50:16,662 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2024-11-18 23:50:16,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:50:16,667 INFO L225 Difference]: With dead ends: 97 [2024-11-18 23:50:16,668 INFO L226 Difference]: Without dead ends: 48 [2024-11-18 23:50:16,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-18 23:50:16,674 INFO L432 NwaCegarLoop]: 68 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, 68 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-18 23:50:16,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:50:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-18 23:50:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-18 23:50:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-18 23:50:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2024-11-18 23:50:16,709 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 108 [2024-11-18 23:50:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:50:16,710 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2024-11-18 23:50:16,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-18 23:50:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2024-11-18 23:50:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-18 23:50:16,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:50:16,713 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:50:16,726 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-18 23:50:16,915 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-18 23:50:16,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:50:16,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:50:16,917 INFO L85 PathProgramCache]: Analyzing trace with hash 648405507, now seen corresponding path program 1 times [2024-11-18 23:50:16,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:50:16,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111603727] [2024-11-18 23:50:16,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:50:16,918 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-18 23:50:16,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:50:16,922 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-18 23:50:16,924 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-18 23:50:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:50:17,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 23:50:17,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:50:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-18 23:50:17,548 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:50:17,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:50:17,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111603727] [2024-11-18 23:50:17,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111603727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:50:17,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:50:17,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:50:17,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652754756] [2024-11-18 23:50:17,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:50:17,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:50:17,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:50:17,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:50:17,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:50:17,555 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-18 23:50:19,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 23:50:19,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:50:19,797 INFO L93 Difference]: Finished difference Result 93 states and 133 transitions. [2024-11-18 23:50:19,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:50:19,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-18 23:50:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:50:19,825 INFO L225 Difference]: With dead ends: 93 [2024-11-18 23:50:19,825 INFO L226 Difference]: Without dead ends: 48 [2024-11-18 23:50:19,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:50:19,827 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:50:19,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-18 23:50:19,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-18 23:50:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-18 23:50:19,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-18 23:50:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2024-11-18 23:50:19,836 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 108 [2024-11-18 23:50:19,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:50:19,839 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2024-11-18 23:50:19,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-18 23:50:19,839 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2024-11-18 23:50:19,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-18 23:50:19,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:50:19,841 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:50:19,859 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 (3)] Forceful destruction successful, exit code 0 [2024-11-18 23:50:20,042 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-18 23:50:20,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:50:20,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:50:20,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1320763996, now seen corresponding path program 1 times [2024-11-18 23:50:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:50:20,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63630646] [2024-11-18 23:50:20,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:50:20,044 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-18 23:50:20,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:50:20,046 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-18 23:50:20,047 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-18 23:50:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:50:20,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-18 23:50:20,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:51:01,050 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-18 23:51:07,124 WARN L286 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-18 23:51:12,751 WARN L286 SmtUtils]: Spent 5.63s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-18 23:51:20,478 WARN L286 SmtUtils]: Spent 7.73s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-18 23:51:28,517 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-18 23:51:36,599 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)