./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_loopvsstraightlinecode_50-while_file-76.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 606d4203eae97c684a2a457b500983abbe696424cb264fcec15d0d5a382fbbe0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:58:20,449 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:58:20,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:58:20,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:58:20,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:58:20,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:58:20,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:58:20,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:58:20,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:58:20,565 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:58:20,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:58:20,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:58:20,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:58:20,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:58:20,569 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:58:20,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:58:20,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:58:20,575 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:58:20,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:58:20,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:58:20,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:58:20,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:58:20,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:58:20,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:58:20,577 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:58:20,578 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:58:20,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:58:20,578 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:58:20,578 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:58:20,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:58:20,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:58:20,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:58:20,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:58:20,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:58:20,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:58:20,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:58:20,582 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:58:20,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:58:20,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:58:20,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:58:20,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:58:20,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:58:20,588 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 -> 606d4203eae97c684a2a457b500983abbe696424cb264fcec15d0d5a382fbbe0 [2024-11-16 16:58:20,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:58:20,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:58:20,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:58:20,870 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:58:20,870 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:58:20,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-76.i [2024-11-16 16:58:22,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:58:22,666 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:58:22,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-76.i [2024-11-16 16:58:22,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fbcb0c18/9275317e9f0b485caa478f797c7974cc/FLAG0df5c7ec3 [2024-11-16 16:58:22,699 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fbcb0c18/9275317e9f0b485caa478f797c7974cc [2024-11-16 16:58:22,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:58:22,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:58:22,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:58:22,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:58:22,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:58:22,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:58:22" (1/1) ... [2024-11-16 16:58:22,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@858b449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:22, skipping insertion in model container [2024-11-16 16:58:22,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:58:22" (1/1) ... [2024-11-16 16:58:22,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:58:22,908 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_loopvsstraightlinecode_50-while_file-76.i[915,928] [2024-11-16 16:58:22,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:58:22,978 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:58:22,990 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_loopvsstraightlinecode_50-while_file-76.i[915,928] [2024-11-16 16:58:23,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:58:23,065 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:58:23,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:23 WrapperNode [2024-11-16 16:58:23,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:58:23,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:58:23,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:58:23,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:58:23,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:23" (1/1) ... [2024-11-16 16:58:23,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:23" (1/1) ... [2024-11-16 16:58:23,153 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-11-16 16:58:23,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:58:23,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:58:23,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:58:23,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:58:23,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:23" (1/1) ... [2024-11-16 16:58:23,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:23" (1/1) ... [2024-11-16 16:58:23,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:23" (1/1) ... [2024-11-16 16:58:23,207 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-16 16:58:23,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:23" (1/1) ... [2024-11-16 16:58:23,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:23" (1/1) ... [2024-11-16 16:58:23,222 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:23" (1/1) ... [2024-11-16 16:58:23,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:23" (1/1) ... [2024-11-16 16:58:23,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:23" (1/1) ... [2024-11-16 16:58:23,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:23" (1/1) ... [2024-11-16 16:58:23,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:58:23,242 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:58:23,242 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:58:23,242 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:58:23,244 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:23" (1/1) ... [2024-11-16 16:58:23,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:58:23,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:58:23,283 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-16 16:58:23,287 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-16 16:58:23,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:58:23,338 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:58:23,339 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:58:23,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:58:23,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:58:23,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:58:23,430 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:58:23,433 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:58:23,761 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L122: havoc property_#t~bitwise13#1;havoc property_#t~short14#1; [2024-11-16 16:58:23,800 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 16:58:23,800 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:58:23,825 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:58:23,825 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:58:23,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:58:23 BoogieIcfgContainer [2024-11-16 16:58:23,826 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:58:23,828 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:58:23,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:58:23,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:58:23,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:58:22" (1/3) ... [2024-11-16 16:58:23,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1b8edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:58:23, skipping insertion in model container [2024-11-16 16:58:23,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:23" (2/3) ... [2024-11-16 16:58:23,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1b8edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:58:23, skipping insertion in model container [2024-11-16 16:58:23,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:58:23" (3/3) ... [2024-11-16 16:58:23,844 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-76.i [2024-11-16 16:58:23,863 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:58:23,864 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:58:23,948 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:58:23,956 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;@5be04360, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:58:23,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:58:23,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 50 states have (on average 1.44) internal successors, (72), 51 states have internal predecessors, (72), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-16 16:58:23,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 16:58:23,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:58:23,974 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:58:23,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:58:23,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:58:23,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1624952093, now seen corresponding path program 1 times [2024-11-16 16:58:23,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:58:23,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340935877] [2024-11-16 16:58:23,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:58:23,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:58:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:58:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:58:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:58:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 16:58:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 16:58:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 16:58:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 16:58:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 16:58:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:58:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:58:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:58:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:58:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 16:58:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:58:24,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:58:24,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340935877] [2024-11-16 16:58:24,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340935877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:58:24,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:58:24,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:58:24,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819312304] [2024-11-16 16:58:24,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:58:24,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:58:24,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:58:24,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:58:24,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:58:24,448 INFO L87 Difference]: Start difference. First operand has 66 states, 50 states have (on average 1.44) internal successors, (72), 51 states have internal predecessors, (72), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 16:58:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:58:24,496 INFO L93 Difference]: Finished difference Result 120 states and 196 transitions. [2024-11-16 16:58:24,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:58:24,504 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 96 [2024-11-16 16:58:24,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:58:24,533 INFO L225 Difference]: With dead ends: 120 [2024-11-16 16:58:24,533 INFO L226 Difference]: Without dead ends: 57 [2024-11-16 16:58:24,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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-16 16:58:24,545 INFO L432 NwaCegarLoop]: 82 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, 82 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-16 16:58:24,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:58:24,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-16 16:58:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-16 16:58:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-16 16:58:24,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2024-11-16 16:58:24,593 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 96 [2024-11-16 16:58:24,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:58:24,593 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2024-11-16 16:58:24,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 16:58:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2024-11-16 16:58:24,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 16:58:24,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:58:24,601 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:58:24,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:58:24,601 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:58:24,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:58:24,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1869406336, now seen corresponding path program 1 times [2024-11-16 16:58:24,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:58:24,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535039387] [2024-11-16 16:58:24,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:58:24,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:58:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:58:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:58:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:58:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 16:58:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 16:58:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 16:58:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 16:58:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 16:58:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:58:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:58:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:24,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:58:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:25,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:58:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:25,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 16:58:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:58:25,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:58:25,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535039387] [2024-11-16 16:58:25,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535039387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:58:25,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:58:25,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:58:25,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983237670] [2024-11-16 16:58:25,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:58:25,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 16:58:25,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:58:25,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 16:58:25,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:58:25,021 INFO L87 Difference]: Start difference. First operand 57 states and 82 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:58:25,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:58:25,181 INFO L93 Difference]: Finished difference Result 165 states and 240 transitions. [2024-11-16 16:58:25,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:58:25,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-16 16:58:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:58:25,186 INFO L225 Difference]: With dead ends: 165 [2024-11-16 16:58:25,187 INFO L226 Difference]: Without dead ends: 111 [2024-11-16 16:58:25,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:58:25,189 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 49 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:58:25,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 196 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:58:25,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-16 16:58:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2024-11-16 16:58:25,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 16:58:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 158 transitions. [2024-11-16 16:58:25,226 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 158 transitions. Word has length 96 [2024-11-16 16:58:25,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:58:25,227 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 158 transitions. [2024-11-16 16:58:25,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:58:25,227 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 158 transitions. [2024-11-16 16:58:25,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 16:58:25,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:58:25,231 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:58:25,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:58:25,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:58:25,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:58:25,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1740323617, now seen corresponding path program 1 times [2024-11-16 16:58:25,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:58:25,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574970343] [2024-11-16 16:58:25,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:58:25,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:58:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 16:58:25,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560517333] [2024-11-16 16:58:25,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:58:25,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:58:25,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:58:25,356 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-16 16:58:25,357 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-16 16:58:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:25,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 16:58:25,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:58:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:58:26,302 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:58:26,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:58:26,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574970343] [2024-11-16 16:58:26,303 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 16:58:26,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560517333] [2024-11-16 16:58:26,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560517333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:58:26,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:58:26,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 16:58:26,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906467061] [2024-11-16 16:58:26,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:58:26,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 16:58:26,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:58:26,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 16:58:26,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:58:26,309 INFO L87 Difference]: Start difference. First operand 108 states and 158 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:58:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:58:27,157 INFO L93 Difference]: Finished difference Result 693 states and 1011 transitions. [2024-11-16 16:58:27,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 16:58:27,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-16 16:58:27,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:58:27,167 INFO L225 Difference]: With dead ends: 693 [2024-11-16 16:58:27,167 INFO L226 Difference]: Without dead ends: 588 [2024-11-16 16:58:27,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2024-11-16 16:58:27,173 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 457 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 16:58:27,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 681 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 16:58:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-16 16:58:27,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 364. [2024-11-16 16:58:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 265 states have (on average 1.3396226415094339) internal successors, (355), 265 states have internal predecessors, (355), 91 states have call successors, (91), 7 states have call predecessors, (91), 7 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-16 16:58:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 537 transitions. [2024-11-16 16:58:27,278 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 537 transitions. Word has length 96 [2024-11-16 16:58:27,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:58:27,279 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 537 transitions. [2024-11-16 16:58:27,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:58:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 537 transitions. [2024-11-16 16:58:27,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 16:58:27,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:58:27,281 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:58:27,298 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-16 16:58:27,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:58:27,482 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:58:27,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:58:27,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1936837122, now seen corresponding path program 1 times [2024-11-16 16:58:27,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:58:27,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410869275] [2024-11-16 16:58:27,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:58:27,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:58:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 16:58:27,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1720436829] [2024-11-16 16:58:27,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:58:27,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:58:27,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:58:27,553 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-16 16:58:27,556 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-16 16:58:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:27,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 16:58:27,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:58:27,817 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:58:27,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:58:27,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:58:27,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410869275] [2024-11-16 16:58:27,820 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 16:58:27,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720436829] [2024-11-16 16:58:27,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720436829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:58:27,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:58:27,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:58:27,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508224630] [2024-11-16 16:58:27,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:58:27,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 16:58:27,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:58:27,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 16:58:27,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 16:58:27,825 INFO L87 Difference]: Start difference. First operand 364 states and 537 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:58:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:58:28,041 INFO L93 Difference]: Finished difference Result 1430 states and 2117 transitions. [2024-11-16 16:58:28,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 16:58:28,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-16 16:58:28,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:58:28,049 INFO L225 Difference]: With dead ends: 1430 [2024-11-16 16:58:28,050 INFO L226 Difference]: Without dead ends: 1069 [2024-11-16 16:58:28,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:58:28,053 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 161 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:58:28,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 928 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:58:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2024-11-16 16:58:28,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 514. [2024-11-16 16:58:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 387 states have (on average 1.3695090439276485) internal successors, (530), 387 states have internal predecessors, (530), 117 states have call successors, (117), 9 states have call predecessors, (117), 9 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-16 16:58:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 764 transitions. [2024-11-16 16:58:28,132 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 764 transitions. Word has length 96 [2024-11-16 16:58:28,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:58:28,133 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 764 transitions. [2024-11-16 16:58:28,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:58:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 764 transitions. [2024-11-16 16:58:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-16 16:58:28,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:58:28,136 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:58:28,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 16:58:28,339 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,SelfDestructingSolverStorable3 [2024-11-16 16:58:28,340 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:58:28,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:58:28,340 INFO L85 PathProgramCache]: Analyzing trace with hash -18139456, now seen corresponding path program 1 times [2024-11-16 16:58:28,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:58:28,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095145756] [2024-11-16 16:58:28,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:58:28,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:58:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 16:58:28,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [606947236] [2024-11-16 16:58:28,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:58:28,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:58:28,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:58:28,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 16:58:28,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 16:58:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:28,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 16:58:28,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:58:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:58:29,062 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:58:29,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:58:29,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095145756] [2024-11-16 16:58:29,063 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 16:58:29,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606947236] [2024-11-16 16:58:29,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606947236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:58:29,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:58:29,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 16:58:29,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077732265] [2024-11-16 16:58:29,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:58:29,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 16:58:29,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:58:29,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 16:58:29,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 16:58:29,066 INFO L87 Difference]: Start difference. First operand 514 states and 764 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:58:29,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:58:29,553 INFO L93 Difference]: Finished difference Result 808 states and 1182 transitions. [2024-11-16 16:58:29,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 16:58:29,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-16 16:58:29,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:58:29,558 INFO L225 Difference]: With dead ends: 808 [2024-11-16 16:58:29,559 INFO L226 Difference]: Without dead ends: 703 [2024-11-16 16:58:29,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-16 16:58:29,561 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 393 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 16:58:29,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 659 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 16:58:29,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-11-16 16:58:29,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 522. [2024-11-16 16:58:29,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 395 states have (on average 1.3822784810126583) internal successors, (546), 395 states have internal predecessors, (546), 117 states have call successors, (117), 9 states have call predecessors, (117), 9 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-16 16:58:29,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 780 transitions. [2024-11-16 16:58:29,622 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 780 transitions. Word has length 97 [2024-11-16 16:58:29,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:58:29,623 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 780 transitions. [2024-11-16 16:58:29,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:58:29,623 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 780 transitions. [2024-11-16 16:58:29,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-16 16:58:29,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:58:29,625 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:58:29,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 16:58:29,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:58:29,826 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:58:29,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:58:29,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2007129889, now seen corresponding path program 1 times [2024-11-16 16:58:29,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:58:29,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018699215] [2024-11-16 16:58:29,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:58:29,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:58:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:29,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:58:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:29,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:58:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:29,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:58:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:29,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 16:58:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:29,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 16:58:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:29,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 16:58:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:29,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 16:58:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:29,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 16:58:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:29,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:58:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:29,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:58:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:29,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:58:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:29,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:58:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:29,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 16:58:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:58:29,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:58:29,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018699215] [2024-11-16 16:58:29,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018699215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:58:29,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:58:29,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:58:29,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698943085] [2024-11-16 16:58:29,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:58:29,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:58:29,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:58:29,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:58:29,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:58:29,924 INFO L87 Difference]: Start difference. First operand 522 states and 780 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:58:29,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:58:29,994 INFO L93 Difference]: Finished difference Result 1303 states and 1937 transitions. [2024-11-16 16:58:29,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:58:29,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-16 16:58:29,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:58:30,000 INFO L225 Difference]: With dead ends: 1303 [2024-11-16 16:58:30,000 INFO L226 Difference]: Without dead ends: 784 [2024-11-16 16:58:30,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-16 16:58:30,003 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 25 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:58:30,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 146 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:58:30,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-16 16:58:30,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 676. [2024-11-16 16:58:30,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 549 states have (on average 1.4043715846994536) internal successors, (771), 549 states have internal predecessors, (771), 117 states have call successors, (117), 9 states have call predecessors, (117), 9 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-16 16:58:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1005 transitions. [2024-11-16 16:58:30,059 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1005 transitions. Word has length 97 [2024-11-16 16:58:30,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:58:30,060 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 1005 transitions. [2024-11-16 16:58:30,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:58:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1005 transitions. [2024-11-16 16:58:30,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-16 16:58:30,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:58:30,062 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:58:30,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 16:58:30,062 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:58:30,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:58:30,063 INFO L85 PathProgramCache]: Analyzing trace with hash -264319554, now seen corresponding path program 1 times [2024-11-16 16:58:30,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:58:30,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554314171] [2024-11-16 16:58:30,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:58:30,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:58:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 16:58:30,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1020480343] [2024-11-16 16:58:30,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:58:30,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:58:30,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:58:30,108 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 16:58:30,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 16:58:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:58:30,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 16:58:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:58:30,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 16:58:30,306 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 16:58:30,307 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 16:58:30,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 16:58:30,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:58:30,513 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:58:30,623 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 16:58:30,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:58:30 BoogieIcfgContainer [2024-11-16 16:58:30,628 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 16:58:30,629 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 16:58:30,629 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 16:58:30,631 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 16:58:30,631 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:58:23" (3/4) ... [2024-11-16 16:58:30,634 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 16:58:30,635 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 16:58:30,636 INFO L158 Benchmark]: Toolchain (without parser) took 7930.96ms. Allocated memory was 159.4MB in the beginning and 255.9MB in the end (delta: 96.5MB). Free memory was 85.6MB in the beginning and 99.5MB in the end (delta: -13.9MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. [2024-11-16 16:58:30,636 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 159.4MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:58:30,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.43ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 128.2MB in the end (delta: -42.8MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-11-16 16:58:30,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.52ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 128.1MB in the beginning and 180.6MB in the end (delta: -52.5MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2024-11-16 16:58:30,636 INFO L158 Benchmark]: Boogie Preprocessor took 82.84ms. Allocated memory is still 211.8MB. Free memory was 180.6MB in the beginning and 177.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 16:58:30,636 INFO L158 Benchmark]: IcfgBuilder took 583.95ms. Allocated memory is still 211.8MB. Free memory was 177.5MB in the beginning and 155.5MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 16:58:30,637 INFO L158 Benchmark]: TraceAbstraction took 6799.90ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 155.5MB in the beginning and 99.5MB in the end (delta: 56.0MB). Peak memory consumption was 99.0MB. Max. memory is 16.1GB. [2024-11-16 16:58:30,637 INFO L158 Benchmark]: Witness Printer took 6.25ms. Allocated memory is still 255.9MB. Free memory is still 99.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:58:30,639 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.24ms. Allocated memory is still 159.4MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.43ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 128.2MB in the end (delta: -42.8MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.52ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 128.1MB in the beginning and 180.6MB in the end (delta: -52.5MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.84ms. Allocated memory is still 211.8MB. Free memory was 180.6MB in the beginning and 177.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 583.95ms. Allocated memory is still 211.8MB. Free memory was 177.5MB in the beginning and 155.5MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6799.90ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 155.5MB in the beginning and 99.5MB in the end (delta: 56.0MB). Peak memory consumption was 99.0MB. Max. memory is 16.1GB. * Witness Printer took 6.25ms. Allocated memory is still 255.9MB. Free memory is still 99.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 122. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 256.5; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 7.5; [L25] double var_1_4 = 256.2; [L26] double var_1_5 = 2.75; [L27] signed long int var_1_6 = -64; [L28] double var_1_7 = 8.05; [L29] float var_1_8 = 5.25; [L30] signed long int var_1_11 = 4; [L31] unsigned short int var_1_14 = 10000; [L32] unsigned short int var_1_16 = 5; [L33] unsigned short int var_1_17 = 4; [L34] unsigned char var_1_18 = 100; [L35] unsigned char var_1_19 = 1; [L36] unsigned char var_1_20 = 8; [L37] double last_1_var_1_1 = 256.5; [L38] float last_1_var_1_8 = 5.25; [L39] signed long int last_1_var_1_11 = 4; [L40] unsigned short int last_1_var_1_14 = 10000; [L41] unsigned short int last_1_var_1_17 = 4; [L42] unsigned char last_1_var_1_18 = 100; VAL [isInitial=0, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L114] last_1_var_1_1 = var_1_1 [L115] last_1_var_1_8 = var_1_8 [L116] last_1_var_1_11 = var_1_11 [L117] last_1_var_1_14 = var_1_14 [L118] last_1_var_1_17 = var_1_17 [L119] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L129] RET updateLastVariables() [L130] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L92] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L93] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L93] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L94] var_1_3 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L95] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L96] var_1_4 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L97] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L98] var_1_5 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L99] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L100] var_1_7 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L101] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L102] CALL assume_abort_if_not(var_1_7 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L102] RET assume_abort_if_not(var_1_7 != 0.0F) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L103] var_1_16 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L104] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L105] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L105] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L106] var_1_19 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L107] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L108] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L108] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L109] var_1_20 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L110] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L111] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L111] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L130] RET updateVariables() [L131] CALL step() [L46] COND FALSE !(\read(var_1_2)) [L55] var_1_17 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L57] COND TRUE ! var_1_2 [L58] var_1_1 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L62] COND FALSE !(var_1_5 > (var_1_3 / var_1_7)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L67] unsigned short int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L68] EXPR var_1_6 | var_1_6 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L68] COND FALSE !((var_1_6 + (var_1_6 | var_1_6)) > stepLocal_1) [L71] COND FALSE !(var_1_5 >= var_1_1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L78] COND TRUE var_1_4 <= last_1_var_1_1 [L79] var_1_11 = (last_1_var_1_14 + -128) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L83] signed long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_0=9872, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L84] COND TRUE (var_1_14 * var_1_17) >= stepLocal_0 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L85] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L122-L123] return (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 7, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1085 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1085 mSDsluCounter, 2692 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1825 mSDsCounter, 203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1028 IncrementalHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 203 mSolverCounterUnsat, 867 mSDtfsCounter, 1028 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 405 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=676occurred in iteration=6, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 1071 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1061 NumberOfCodeBlocks, 1061 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 572 ConstructedInterpolants, 0 QuantifiedInterpolants, 2490 SizeOfPredicates, 14 NumberOfNonLiveVariables, 735 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1872/1872 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-16 16:58:30,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_loopvsstraightlinecode_50-while_file-76.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 606d4203eae97c684a2a457b500983abbe696424cb264fcec15d0d5a382fbbe0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:58:32,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:58:33,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 16:58:33,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:58:33,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:58:33,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:58:33,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:58:33,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:58:33,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:58:33,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:58:33,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:58:33,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:58:33,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:58:33,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:58:33,070 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:58:33,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:58:33,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:58:33,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:58:33,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:58:33,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:58:33,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:58:33,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:58:33,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:58:33,076 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 16:58:33,077 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 16:58:33,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:58:33,077 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 16:58:33,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:58:33,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:58:33,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:58:33,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:58:33,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:58:33,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:58:33,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:58:33,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:58:33,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:58:33,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:58:33,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:58:33,080 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 16:58:33,081 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 16:58:33,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:58:33,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:58:33,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:58:33,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:58:33,083 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 -> 606d4203eae97c684a2a457b500983abbe696424cb264fcec15d0d5a382fbbe0 [2024-11-16 16:58:33,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:58:33,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:58:33,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:58:33,447 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:58:33,447 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:58:33,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-76.i [2024-11-16 16:58:35,098 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:58:35,338 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:58:35,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-76.i [2024-11-16 16:58:35,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a2783c96/8777c18767864088870cb10fdec6d6df/FLAGaa9ef3857 [2024-11-16 16:58:35,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a2783c96/8777c18767864088870cb10fdec6d6df [2024-11-16 16:58:35,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:58:35,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:58:35,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:58:35,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:58:35,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:58:35,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:58:35" (1/1) ... [2024-11-16 16:58:35,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d115d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:35, skipping insertion in model container [2024-11-16 16:58:35,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:58:35" (1/1) ... [2024-11-16 16:58:35,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:58:35,936 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_loopvsstraightlinecode_50-while_file-76.i[915,928] [2024-11-16 16:58:36,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:58:36,044 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:58:36,059 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_loopvsstraightlinecode_50-while_file-76.i[915,928] [2024-11-16 16:58:36,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:58:36,127 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:58:36,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:36 WrapperNode [2024-11-16 16:58:36,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:58:36,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:58:36,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:58:36,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:58:36,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:36" (1/1) ... [2024-11-16 16:58:36,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:36" (1/1) ... [2024-11-16 16:58:36,191 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-11-16 16:58:36,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:58:36,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:58:36,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:58:36,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:58:36,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:36" (1/1) ... [2024-11-16 16:58:36,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:36" (1/1) ... [2024-11-16 16:58:36,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:36" (1/1) ... [2024-11-16 16:58:36,234 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-16 16:58:36,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:36" (1/1) ... [2024-11-16 16:58:36,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:36" (1/1) ... [2024-11-16 16:58:36,251 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:36" (1/1) ... [2024-11-16 16:58:36,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:36" (1/1) ... [2024-11-16 16:58:36,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:36" (1/1) ... [2024-11-16 16:58:36,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:36" (1/1) ... [2024-11-16 16:58:36,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:58:36,272 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:58:36,272 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:58:36,272 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:58:36,273 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:36" (1/1) ... [2024-11-16 16:58:36,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:58:36,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:58:36,310 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-16 16:58:36,317 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-16 16:58:36,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:58:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 16:58:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:58:36,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:58:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:58:36,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:58:36,475 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:58:36,478 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:58:49,808 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 16:58:49,808 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:58:49,830 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:58:49,831 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:58:49,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:58:49 BoogieIcfgContainer [2024-11-16 16:58:49,832 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:58:49,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:58:49,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:58:49,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:58:49,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:58:35" (1/3) ... [2024-11-16 16:58:49,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3296a7a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:58:49, skipping insertion in model container [2024-11-16 16:58:49,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:58:36" (2/3) ... [2024-11-16 16:58:49,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3296a7a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:58:49, skipping insertion in model container [2024-11-16 16:58:49,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:58:49" (3/3) ... [2024-11-16 16:58:49,844 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-76.i [2024-11-16 16:58:49,862 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:58:49,863 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:58:49,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:58:49,953 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;@3ecb84f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:58:49,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:58:49,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-16 16:58:49,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-16 16:58:49,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:58:49,975 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:58:49,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:58:49,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:58:49,982 INFO L85 PathProgramCache]: Analyzing trace with hash 438688861, now seen corresponding path program 1 times [2024-11-16 16:58:49,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:58:49,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715327205] [2024-11-16 16:58:49,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:58:49,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:58:49,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:58:50,002 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-16 16:58:50,004 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-16 16:58:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:50,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 16:58:50,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:58:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-16 16:58:50,877 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:58:50,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:58:50,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715327205] [2024-11-16 16:58:50,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715327205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:58:50,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:58:50,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:58:50,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153298411] [2024-11-16 16:58:50,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:58:50,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:58:50,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:58:50,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:58:50,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:58:50,922 INFO L87 Difference]: Start difference. First operand has 57 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 16:58:50,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:58:50,948 INFO L93 Difference]: Finished difference Result 106 states and 174 transitions. [2024-11-16 16:58:50,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:58:50,950 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 93 [2024-11-16 16:58:50,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:58:50,957 INFO L225 Difference]: With dead ends: 106 [2024-11-16 16:58:50,957 INFO L226 Difference]: Without dead ends: 52 [2024-11-16 16:58:50,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-16 16:58:50,963 INFO L432 NwaCegarLoop]: 76 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, 76 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-16 16:58:50,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:58:50,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-16 16:58:50,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-16 16:58:50,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-16 16:58:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2024-11-16 16:58:51,000 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 93 [2024-11-16 16:58:51,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:58:51,001 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-11-16 16:58:51,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 16:58:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-11-16 16:58:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-16 16:58:51,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:58:51,007 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:58:51,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 16:58:51,207 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-16 16:58:51,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:58:51,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:58:51,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1495900966, now seen corresponding path program 1 times [2024-11-16 16:58:51,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:58:51,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762932698] [2024-11-16 16:58:51,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:58:51,210 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-16 16:58:51,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:58:51,212 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-16 16:58:51,213 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-16 16:58:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:58:52,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 16:58:52,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:58:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:58:54,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:58:54,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:58:54,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762932698] [2024-11-16 16:58:54,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762932698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:58:54,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:58:54,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:58:54,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221374568] [2024-11-16 16:58:54,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:58:54,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:58:54,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:58:54,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:58:54,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:58:54,219 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:58:58,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:59:02,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:59:02,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:59:02,555 INFO L93 Difference]: Finished difference Result 150 states and 222 transitions. [2024-11-16 16:59:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:59:02,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-11-16 16:59:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:59:02,650 INFO L225 Difference]: With dead ends: 150 [2024-11-16 16:59:02,650 INFO L226 Difference]: Without dead ends: 101 [2024-11-16 16:59:02,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 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-16 16:59:02,652 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 27 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-16 16:59:02,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2024-11-16 16:59:02,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-16 16:59:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-16 16:59:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 69 states have internal predecessors, (94), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 16:59:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2024-11-16 16:59:02,685 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 93 [2024-11-16 16:59:02,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:59:02,685 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2024-11-16 16:59:02,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:59:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2024-11-16 16:59:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-16 16:59:02,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:59:02,692 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:59:02,714 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-16 16:59:02,892 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-16 16:59:02,893 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:59:02,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:59:02,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1692414471, now seen corresponding path program 1 times [2024-11-16 16:59:02,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:59:02,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420211802] [2024-11-16 16:59:02,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:59:02,895 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-16 16:59:02,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:59:02,896 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-16 16:59:02,898 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-16 16:59:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:59:03,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 16:59:03,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:59:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:59:10,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:59:10,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:59:10,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420211802] [2024-11-16 16:59:10,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420211802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:59:10,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:59:10,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 16:59:10,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400067422] [2024-11-16 16:59:10,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:59:10,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 16:59:10,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:59:10,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 16:59:10,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:59:10,589 INFO L87 Difference]: Start difference. First operand 98 states and 146 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:59:17,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:59:21,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:59:25,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:59:29,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:59:33,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:59:37,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:59:38,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:59:43,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:59:47,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:59:51,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []