./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.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 edefa3ede03a09b2efca71b139c957891dc8e0f1d7994a4b8237a639ffd3afb0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:33:13,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:33:13,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:33:13,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:33:13,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:33:13,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:33:13,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:33:13,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:33:13,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:33:13,872 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:33:13,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:33:13,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:33:13,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:33:13,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:33:13,874 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:33:13,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:33:13,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:33:13,875 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:33:13,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:33:13,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:33:13,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:33:13,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:33:13,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:33:13,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:33:13,880 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:33:13,880 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:33:13,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:33:13,881 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:33:13,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:33:13,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:33:13,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:33:13,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:33:13,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:33:13,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:33:13,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:33:13,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:33:13,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:33:13,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:33:13,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:33:13,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:33:13,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:33:13,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:33:13,885 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 -> edefa3ede03a09b2efca71b139c957891dc8e0f1d7994a4b8237a639ffd3afb0 [2024-11-20 06:33:14,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:33:14,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:33:14,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:33:14,178 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:33:14,178 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:33:14,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.i [2024-11-20 06:33:15,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:33:15,755 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:33:15,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.i [2024-11-20 06:33:15,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0133c98/f58f66057afd4d12a2a83450a558d7e4/FLAGde0394cff [2024-11-20 06:33:15,776 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0133c98/f58f66057afd4d12a2a83450a558d7e4 [2024-11-20 06:33:15,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:33:15,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:33:15,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:33:15,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:33:15,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:33:15,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:33:15" (1/1) ... [2024-11-20 06:33:15,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed543ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:15, skipping insertion in model container [2024-11-20 06:33:15,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:33:15" (1/1) ... [2024-11-20 06:33:15,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:33:16,000 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_25-1loop_file-31.i[915,928] [2024-11-20 06:33:16,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:33:16,049 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:33:16,060 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_25-1loop_file-31.i[915,928] [2024-11-20 06:33:16,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:33:16,103 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:33:16,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:16 WrapperNode [2024-11-20 06:33:16,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:33:16,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:33:16,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:33:16,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:33:16,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:16" (1/1) ... [2024-11-20 06:33:16,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:16" (1/1) ... [2024-11-20 06:33:16,153 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-20 06:33:16,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:33:16,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:33:16,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:33:16,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:33:16,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:16" (1/1) ... [2024-11-20 06:33:16,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:16" (1/1) ... [2024-11-20 06:33:16,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:16" (1/1) ... [2024-11-20 06:33:16,187 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-20 06:33:16,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:16" (1/1) ... [2024-11-20 06:33:16,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:16" (1/1) ... [2024-11-20 06:33:16,196 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:16" (1/1) ... [2024-11-20 06:33:16,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:16" (1/1) ... [2024-11-20 06:33:16,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:16" (1/1) ... [2024-11-20 06:33:16,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:16" (1/1) ... [2024-11-20 06:33:16,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:33:16,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:33:16,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:33:16,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:33:16,222 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:16" (1/1) ... [2024-11-20 06:33:16,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:33:16,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:33:16,267 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-20 06:33:16,274 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-20 06:33:16,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:33:16,324 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:33:16,325 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:33:16,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:33:16,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:33:16,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:33:16,403 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:33:16,408 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:33:16,736 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 06:33:16,736 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:33:16,754 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:33:16,754 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:33:16,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:33:16 BoogieIcfgContainer [2024-11-20 06:33:16,755 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:33:16,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:33:16,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:33:16,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:33:16,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:33:15" (1/3) ... [2024-11-20 06:33:16,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b7c0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:33:16, skipping insertion in model container [2024-11-20 06:33:16,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:16" (2/3) ... [2024-11-20 06:33:16,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b7c0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:33:16, skipping insertion in model container [2024-11-20 06:33:16,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:33:16" (3/3) ... [2024-11-20 06:33:16,765 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-31.i [2024-11-20 06:33:16,781 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:33:16,782 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:33:16,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:33:16,859 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;@3aba90d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:33:16,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:33:16,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 44 states have internal predecessors, (61), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 06:33:16,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 06:33:16,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:33:16,877 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:33:16,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:33:16,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:33:16,886 INFO L85 PathProgramCache]: Analyzing trace with hash -298760130, now seen corresponding path program 1 times [2024-11-20 06:33:16,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:33:16,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831839295] [2024-11-20 06:33:16,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:33:16,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:33:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:17,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:33:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:17,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:33:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:17,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:33:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:17,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:33:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:17,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:33:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:17,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:33:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:17,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:33:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:17,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:33:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:17,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:33:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:17,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:33:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:17,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:33:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 06:33:17,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:33:17,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831839295] [2024-11-20 06:33:17,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831839295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:33:17,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:33:17,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:33:17,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791243580] [2024-11-20 06:33:17,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:33:17,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:33:17,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:33:17,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:33:17,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:33:17,296 INFO L87 Difference]: Start difference. First operand has 57 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 44 states have internal predecessors, (61), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 06:33:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:33:17,325 INFO L93 Difference]: Finished difference Result 111 states and 174 transitions. [2024-11-20 06:33:17,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:33:17,327 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2024-11-20 06:33:17,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:33:17,335 INFO L225 Difference]: With dead ends: 111 [2024-11-20 06:33:17,336 INFO L226 Difference]: Without dead ends: 53 [2024-11-20 06:33:17,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:33:17,345 INFO L432 NwaCegarLoop]: 80 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, 80 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-20 06:33:17,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:33:17,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-20 06:33:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-20 06:33:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 06:33:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2024-11-20 06:33:17,397 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 77 [2024-11-20 06:33:17,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:33:17,398 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2024-11-20 06:33:17,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 06:33:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2024-11-20 06:33:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 06:33:17,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:33:17,405 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:33:17,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:33:17,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:33:17,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:33:17,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1753793024, now seen corresponding path program 1 times [2024-11-20 06:33:17,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:33:17,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206316424] [2024-11-20 06:33:17,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:33:17,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:33:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:18,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:33:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:18,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:33:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:18,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:33:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:18,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:33:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:18,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:33:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:18,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:33:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:18,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:33:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:18,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:33:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:18,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:33:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:18,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:33:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:18,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:33:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 06:33:18,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:33:18,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206316424] [2024-11-20 06:33:18,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206316424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:33:18,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:33:18,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:33:18,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963086219] [2024-11-20 06:33:18,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:33:18,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:33:18,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:33:18,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:33:18,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:33:18,394 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 06:33:18,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:33:18,642 INFO L93 Difference]: Finished difference Result 159 states and 224 transitions. [2024-11-20 06:33:18,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 06:33:18,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 77 [2024-11-20 06:33:18,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:33:18,646 INFO L225 Difference]: With dead ends: 159 [2024-11-20 06:33:18,646 INFO L226 Difference]: Without dead ends: 109 [2024-11-20 06:33:18,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 06:33:18,648 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 73 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:33:18,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 276 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:33:18,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-20 06:33:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2024-11-20 06:33:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 69 states have internal predecessors, (90), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 06:33:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 128 transitions. [2024-11-20 06:33:18,675 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 128 transitions. Word has length 77 [2024-11-20 06:33:18,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:33:18,676 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 128 transitions. [2024-11-20 06:33:18,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 06:33:18,676 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 128 transitions. [2024-11-20 06:33:18,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 06:33:18,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:33:18,677 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:33:18,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:33:18,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:33:18,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:33:18,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1073734654, now seen corresponding path program 1 times [2024-11-20 06:33:18,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:33:18,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051289996] [2024-11-20 06:33:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:33:18,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:33:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:33:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:33:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:33:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:33:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:33:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:33:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:33:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:33:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:33:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:33:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:33:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 06:33:19,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:33:19,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051289996] [2024-11-20 06:33:19,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051289996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:33:19,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:33:19,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 06:33:19,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21298484] [2024-11-20 06:33:19,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:33:19,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 06:33:19,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:33:19,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 06:33:19,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 06:33:19,166 INFO L87 Difference]: Start difference. First operand 90 states and 128 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 06:33:19,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:33:19,377 INFO L93 Difference]: Finished difference Result 208 states and 294 transitions. [2024-11-20 06:33:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 06:33:19,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 77 [2024-11-20 06:33:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:33:19,381 INFO L225 Difference]: With dead ends: 208 [2024-11-20 06:33:19,381 INFO L226 Difference]: Without dead ends: 121 [2024-11-20 06:33:19,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:33:19,385 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 47 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:33:19,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 258 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:33:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-20 06:33:19,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 93. [2024-11-20 06:33:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 72 states have internal predecessors, (93), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 06:33:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2024-11-20 06:33:19,409 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 77 [2024-11-20 06:33:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:33:19,410 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2024-11-20 06:33:19,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 06:33:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2024-11-20 06:33:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 06:33:19,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:33:19,412 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:33:19,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:33:19,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:33:19,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:33:19,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1129951385, now seen corresponding path program 1 times [2024-11-20 06:33:19,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:33:19,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449355732] [2024-11-20 06:33:19,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:33:19,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:33:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:33:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:33:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:33:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:33:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:33:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:33:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:33:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:33:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:33:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:33:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:33:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:19,994 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 06:33:19,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:33:19,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449355732] [2024-11-20 06:33:19,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449355732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:33:19,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:33:19,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 06:33:19,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041935314] [2024-11-20 06:33:19,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:33:19,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 06:33:19,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:33:19,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 06:33:19,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 06:33:19,998 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 06:33:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:33:20,227 INFO L93 Difference]: Finished difference Result 202 states and 281 transitions. [2024-11-20 06:33:20,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 06:33:20,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 78 [2024-11-20 06:33:20,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:33:20,231 INFO L225 Difference]: With dead ends: 202 [2024-11-20 06:33:20,231 INFO L226 Difference]: Without dead ends: 112 [2024-11-20 06:33:20,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:33:20,237 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 100 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:33:20,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 265 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:33:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-20 06:33:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 90. [2024-11-20 06:33:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 69 states have internal predecessors, (89), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 06:33:20,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2024-11-20 06:33:20,259 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 78 [2024-11-20 06:33:20,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:33:20,263 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2024-11-20 06:33:20,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 06:33:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2024-11-20 06:33:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 06:33:20,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:33:20,265 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:33:20,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:33:20,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:33:20,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:33:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash 736924375, now seen corresponding path program 1 times [2024-11-20 06:33:20,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:33:20,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337375623] [2024-11-20 06:33:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:33:20,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:33:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:20,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:33:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:20,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:33:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:20,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:33:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:20,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:33:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:20,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:33:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:20,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:33:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:20,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:33:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:20,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:33:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:20,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:33:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:20,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:33:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:20,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:33:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 06:33:20,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:33:20,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337375623] [2024-11-20 06:33:20,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337375623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:33:20,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:33:20,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 06:33:20,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413404236] [2024-11-20 06:33:20,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:33:20,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 06:33:20,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:33:20,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 06:33:20,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:33:20,731 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 06:33:20,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:33:20,961 INFO L93 Difference]: Finished difference Result 208 states and 291 transitions. [2024-11-20 06:33:20,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:33:20,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 78 [2024-11-20 06:33:20,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:33:20,965 INFO L225 Difference]: With dead ends: 208 [2024-11-20 06:33:20,966 INFO L226 Difference]: Without dead ends: 121 [2024-11-20 06:33:20,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-20 06:33:20,967 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 89 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:33:20,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 242 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:33:20,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-20 06:33:20,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 87. [2024-11-20 06:33:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 66 states have internal predecessors, (85), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 06:33:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-11-20 06:33:20,983 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 78 [2024-11-20 06:33:20,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:33:20,983 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-11-20 06:33:20,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 06:33:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-11-20 06:33:20,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-20 06:33:20,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:33:20,985 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:33:20,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 06:33:20,986 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:33:20,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:33:20,986 INFO L85 PathProgramCache]: Analyzing trace with hash -710760677, now seen corresponding path program 1 times [2024-11-20 06:33:20,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:33:20,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397586939] [2024-11-20 06:33:20,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:33:20,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:33:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:33:21,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [706739449] [2024-11-20 06:33:21,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:33:21,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:33:21,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:33:21,016 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-20 06:33:21,017 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-20 06:33:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:21,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 06:33:21,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:33:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-20 06:33:21,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:33:21,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:33:21,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397586939] [2024-11-20 06:33:21,698 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 06:33:21,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706739449] [2024-11-20 06:33:21,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706739449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:33:21,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-20 06:33:21,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-20 06:33:21,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609216257] [2024-11-20 06:33:21,699 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-20 06:33:21,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 06:33:21,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:33:21,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 06:33:21,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:33:21,701 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 06:33:22,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:33:22,023 INFO L93 Difference]: Finished difference Result 234 states and 326 transitions. [2024-11-20 06:33:22,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 06:33:22,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2024-11-20 06:33:22,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:33:22,025 INFO L225 Difference]: With dead ends: 234 [2024-11-20 06:33:22,026 INFO L226 Difference]: Without dead ends: 150 [2024-11-20 06:33:22,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2024-11-20 06:33:22,028 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 103 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:33:22,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 305 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:33:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-20 06:33:22,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 126. [2024-11-20 06:33:22,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 91 states have internal predecessors, (115), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 06:33:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 175 transitions. [2024-11-20 06:33:22,058 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 175 transitions. Word has length 79 [2024-11-20 06:33:22,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:33:22,059 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 175 transitions. [2024-11-20 06:33:22,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 06:33:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 175 transitions. [2024-11-20 06:33:22,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-20 06:33:22,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:33:22,061 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:33:22,070 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-20 06:33:22,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 06:33:22,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:33:22,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:33:22,264 INFO L85 PathProgramCache]: Analyzing trace with hash -9696099, now seen corresponding path program 1 times [2024-11-20 06:33:22,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:33:22,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366787622] [2024-11-20 06:33:22,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:33:22,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:33:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:33:22,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [999658081] [2024-11-20 06:33:22,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:33:22,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:33:22,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:33:22,308 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-20 06:33:22,311 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-20 06:33:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:33:22,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:33:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:33:22,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 06:33:22,465 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 06:33:22,466 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:33:22,477 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-20 06:33:22,671 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,SelfDestructingSolverStorable6 [2024-11-20 06:33:22,675 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:33:22,741 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:33:22,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:33:22 BoogieIcfgContainer [2024-11-20 06:33:22,744 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:33:22,745 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:33:22,745 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:33:22,745 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:33:22,745 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:33:16" (3/4) ... [2024-11-20 06:33:22,748 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 06:33:22,749 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:33:22,749 INFO L158 Benchmark]: Toolchain (without parser) took 6969.13ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 122.0MB in the beginning and 147.2MB in the end (delta: -25.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-20 06:33:22,750 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 109.1MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:33:22,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.78ms. Allocated memory is still 159.4MB. Free memory was 122.0MB in the beginning and 108.3MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 06:33:22,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.94ms. Allocated memory is still 159.4MB. Free memory was 108.3MB in the beginning and 105.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 06:33:22,750 INFO L158 Benchmark]: Boogie Preprocessor took 62.82ms. Allocated memory is still 159.4MB. Free memory was 105.2MB in the beginning and 102.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:33:22,750 INFO L158 Benchmark]: RCFGBuilder took 537.44ms. Allocated memory is still 159.4MB. Free memory was 102.0MB in the beginning and 117.9MB in the end (delta: -15.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 06:33:22,751 INFO L158 Benchmark]: TraceAbstraction took 5987.32ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 116.8MB in the beginning and 148.2MB in the end (delta: -31.4MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2024-11-20 06:33:22,751 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 232.8MB. Free memory was 148.2MB in the beginning and 147.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:33:22,752 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.53ms. Allocated memory is still 109.1MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.78ms. Allocated memory is still 159.4MB. Free memory was 122.0MB in the beginning and 108.3MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.94ms. Allocated memory is still 159.4MB. Free memory was 108.3MB in the beginning and 105.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.82ms. Allocated memory is still 159.4MB. Free memory was 105.2MB in the beginning and 102.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 537.44ms. Allocated memory is still 159.4MB. Free memory was 102.0MB in the beginning and 117.9MB in the end (delta: -15.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5987.32ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 116.8MB in the beginning and 148.2MB in the end (delta: -31.4MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 232.8MB. Free memory was 148.2MB in the beginning and 147.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 200; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1107940323; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 16; [L28] unsigned char var_1_9 = 16; [L29] unsigned short int var_1_10 = 4; [L30] double var_1_11 = 1000000.5; [L31] double var_1_12 = 1.25; [L32] signed long int last_1_var_1_1 = 200; [L33] unsigned char last_1_var_1_8 = 16; [L34] unsigned short int last_1_var_1_10 = 4; VAL [isInitial=0, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=0, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L91] isInitial = 1 [L92] FCALL initially() [L93] int k_loop; [L94] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=0, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L94] COND TRUE k_loop < 1 [L95] CALL updateLastVariables() [L82] last_1_var_1_1 = var_1_1 [L83] last_1_var_1_8 = var_1_8 [L84] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=0, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L95] RET updateLastVariables() [L96] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L66] var_1_3 = __VERIFIER_nondet_long() [L67] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L67] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L68] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L68] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_7=0, var_1_8=16, var_1_9=16] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_7=0, var_1_8=16, var_1_9=16] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=0, var_1_8=16, var_1_9=16] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=0, var_1_8=16, var_1_9=16] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_8=16, var_1_9=16] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_8=16, var_1_9=16] [L74] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=16] [L74] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=16] [L75] var_1_9 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16] [L77] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L78] var_1_12 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L79] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L96] RET updateVariables() [L97] CALL step() [L38] signed long int stepLocal_2 = last_1_var_1_8; [L39] signed long int stepLocal_1 = var_1_3 * last_1_var_1_8; VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_1=17179869152, stepLocal_2=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L40] COND TRUE stepLocal_1 >= last_1_var_1_1 [L41] var_1_10 = (2 + var_1_9) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=2, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L49] signed long int stepLocal_0 = last_1_var_1_10 / var_1_3; VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_0=0, stepLocal_2=16, var_1_10=2, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L50] COND FALSE !(stepLocal_0 >= (500 - last_1_var_1_10)) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=2, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L53] COND TRUE \read(var_1_2) [L54] var_1_1 = ((var_1_3 - var_1_10) - var_1_8) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=2, var_1_11=2000001/2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L60] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L97] RET step() [L98] CALL, EXPR property() [L87] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_10) - var_1_8))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((signed long int) var_1_10)) : 1)) && (((last_1_var_1_10 / var_1_3) >= (500 - last_1_var_1_10)) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && (((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L87] EXPR ((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L87] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_10) - var_1_8))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((signed long int) var_1_10)) : 1)) && (((last_1_var_1_10 / var_1_3) >= (500 - last_1_var_1_10)) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && (((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L87-L88] return (((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_10) - var_1_8))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((signed long int) var_1_10)) : 1)) && (((last_1_var_1_10 / var_1_3) >= (500 - last_1_var_1_10)) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && (((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1))))) && (var_1_11 == ((double) var_1_12)) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=-255, var_1_7=1, var_1_8=16, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 412 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 412 mSDsluCounter, 1426 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 959 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 428 IncrementalHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 467 mSDtfsCounter, 428 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 127 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 703 NumberOfCodeBlocks, 703 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 460 ConstructedInterpolants, 1 QuantifiedInterpolants, 1486 SizeOfPredicates, 3 NumberOfNonLiveVariables, 202 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 1296/1320 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-20 06:33:22,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.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 edefa3ede03a09b2efca71b139c957891dc8e0f1d7994a4b8237a639ffd3afb0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:33:25,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:33:25,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 06:33:25,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:33:25,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:33:25,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:33:25,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:33:25,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:33:25,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:33:25,143 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:33:25,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:33:25,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:33:25,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:33:25,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:33:25,148 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:33:25,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:33:25,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:33:25,149 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:33:25,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:33:25,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:33:25,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:33:25,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:33:25,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:33:25,152 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 06:33:25,153 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 06:33:25,153 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:33:25,154 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 06:33:25,154 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:33:25,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:33:25,155 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:33:25,155 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:33:25,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:33:25,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:33:25,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:33:25,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:33:25,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:33:25,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:33:25,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:33:25,169 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 06:33:25,169 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 06:33:25,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:33:25,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:33:25,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:33:25,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:33:25,170 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 -> edefa3ede03a09b2efca71b139c957891dc8e0f1d7994a4b8237a639ffd3afb0 [2024-11-20 06:33:25,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:33:25,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:33:25,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:33:25,517 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:33:25,518 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:33:25,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.i [2024-11-20 06:33:27,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:33:27,251 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:33:27,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.i [2024-11-20 06:33:27,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13a1afc8/0692241aa60943f99ac98483fe5db5f3/FLAG7b8eff751 [2024-11-20 06:33:27,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13a1afc8/0692241aa60943f99ac98483fe5db5f3 [2024-11-20 06:33:27,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:33:27,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:33:27,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:33:27,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:33:27,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:33:27,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:33:27" (1/1) ... [2024-11-20 06:33:27,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66444b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:27, skipping insertion in model container [2024-11-20 06:33:27,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:33:27" (1/1) ... [2024-11-20 06:33:27,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:33:27,517 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_25-1loop_file-31.i[915,928] [2024-11-20 06:33:27,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:33:27,584 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:33:27,597 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_25-1loop_file-31.i[915,928] [2024-11-20 06:33:27,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:33:27,651 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:33:27,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:27 WrapperNode [2024-11-20 06:33:27,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:33:27,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:33:27,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:33:27,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:33:27,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:27" (1/1) ... [2024-11-20 06:33:27,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:27" (1/1) ... [2024-11-20 06:33:27,703 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-11-20 06:33:27,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:33:27,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:33:27,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:33:27,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:33:27,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:27" (1/1) ... [2024-11-20 06:33:27,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:27" (1/1) ... [2024-11-20 06:33:27,722 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:27" (1/1) ... [2024-11-20 06:33:27,735 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-20 06:33:27,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:27" (1/1) ... [2024-11-20 06:33:27,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:27" (1/1) ... [2024-11-20 06:33:27,750 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:27" (1/1) ... [2024-11-20 06:33:27,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:27" (1/1) ... [2024-11-20 06:33:27,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:27" (1/1) ... [2024-11-20 06:33:27,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:27" (1/1) ... [2024-11-20 06:33:27,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:33:27,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:33:27,772 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:33:27,772 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:33:27,773 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:27" (1/1) ... [2024-11-20 06:33:27,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:33:27,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:33:27,809 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-20 06:33:27,811 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-20 06:33:27,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:33:27,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 06:33:27,861 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:33:27,861 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:33:27,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:33:27,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:33:27,947 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:33:27,949 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:33:28,238 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-20 06:33:28,239 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:33:28,251 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:33:28,251 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:33:28,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:33:28 BoogieIcfgContainer [2024-11-20 06:33:28,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:33:28,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:33:28,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:33:28,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:33:28,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:33:27" (1/3) ... [2024-11-20 06:33:28,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e10f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:33:28, skipping insertion in model container [2024-11-20 06:33:28,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:33:27" (2/3) ... [2024-11-20 06:33:28,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e10f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:33:28, skipping insertion in model container [2024-11-20 06:33:28,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:33:28" (3/3) ... [2024-11-20 06:33:28,262 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-31.i [2024-11-20 06:33:28,276 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:33:28,276 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:33:28,335 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:33:28,342 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;@1fe4f3a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:33:28,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:33:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 06:33:28,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-20 06:33:28,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:33:28,358 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:33:28,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:33:28,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:33:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash 719468721, now seen corresponding path program 1 times [2024-11-20 06:33:28,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:33:28,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747677216] [2024-11-20 06:33:28,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:33:28,384 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-20 06:33:28,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:33:28,387 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-20 06:33:28,389 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-20 06:33:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:28,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 06:33:28,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:33:28,670 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-20 06:33:28,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:33:28,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:33:28,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747677216] [2024-11-20 06:33:28,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747677216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:33:28,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:33:28,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:33:28,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815942797] [2024-11-20 06:33:28,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:33:28,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:33:28,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:33:28,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:33:28,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:33:28,709 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 06:33:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:33:28,736 INFO L93 Difference]: Finished difference Result 85 states and 132 transitions. [2024-11-20 06:33:28,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:33:28,739 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 75 [2024-11-20 06:33:28,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:33:28,747 INFO L225 Difference]: With dead ends: 85 [2024-11-20 06:33:28,747 INFO L226 Difference]: Without dead ends: 40 [2024-11-20 06:33:28,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:33:28,756 INFO L432 NwaCegarLoop]: 59 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, 59 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-20 06:33:28,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:33:28,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-20 06:33:28,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-20 06:33:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 06:33:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2024-11-20 06:33:28,804 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 75 [2024-11-20 06:33:28,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:33:28,805 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2024-11-20 06:33:28,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 06:33:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2024-11-20 06:33:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-20 06:33:28,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:33:28,809 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:33:28,817 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-20 06:33:29,013 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-20 06:33:29,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:33:29,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:33:29,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1118914829, now seen corresponding path program 1 times [2024-11-20 06:33:29,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:33:29,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169248587] [2024-11-20 06:33:29,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:33:29,017 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-20 06:33:29,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:33:29,019 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-20 06:33:29,021 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-20 06:33:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:33:29,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 06:33:29,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:33:40,970 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 130 proven. 18 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-20 06:33:40,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:34:05,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:34:05,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169248587] [2024-11-20 06:34:05,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169248587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:34:05,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [44721877] [2024-11-20 06:34:05,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:34:05,116 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 06:34:05,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 06:34:05,119 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 06:34:05,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-20 06:34:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:05,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-20 06:34:05,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:34:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-20 06:34:19,771 INFO L311 TraceCheckSpWp]: Computing backward predicates...