./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.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 654542981f55ac0dfa4ff9a5a73c4558ad4f81f278b418004930bd889a962b4b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:27:06,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:27:06,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 03:27:06,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:27:07,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:27:07,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:27:07,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:27:07,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:27:07,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:27:07,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:27:07,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:27:07,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:27:07,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:27:07,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:27:07,032 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:27:07,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:27:07,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:27:07,033 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:27:07,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 03:27:07,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:27:07,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:27:07,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:27:07,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:27:07,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:27:07,039 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:27:07,039 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:27:07,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:27:07,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:27:07,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:27:07,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:27:07,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:27:07,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:27:07,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:27:07,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:27:07,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:27:07,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:27:07,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 03:27:07,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 03:27:07,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:27:07,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:27:07,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:27:07,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:27:07,045 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 -> 654542981f55ac0dfa4ff9a5a73c4558ad4f81f278b418004930bd889a962b4b [2024-11-12 03:27:07,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:27:07,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:27:07,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:27:07,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:27:07,355 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:27:07,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-11-12 03:27:08,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:27:09,164 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:27:09,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-11-12 03:27:09,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca3445cdf/b96302a343334e0c8b5793d0b94f0dc6/FLAG1a6f085b3 [2024-11-12 03:27:09,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca3445cdf/b96302a343334e0c8b5793d0b94f0dc6 [2024-11-12 03:27:09,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:27:09,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:27:09,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:27:09,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:27:09,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:27:09,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:27:09" (1/1) ... [2024-11-12 03:27:09,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78eb153d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:09, skipping insertion in model container [2024-11-12 03:27:09,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:27:09" (1/1) ... [2024-11-12 03:27:09,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:27:09,767 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_fillercode_fillercodestructure_filler-pr-ci_file-83.i[919,932] [2024-11-12 03:27:09,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:27:09,889 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:27:09,902 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_fillercode_fillercodestructure_filler-pr-ci_file-83.i[919,932] [2024-11-12 03:27:09,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:27:09,985 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:27:09,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:09 WrapperNode [2024-11-12 03:27:09,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:27:09,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:27:09,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:27:09,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:27:09,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:09" (1/1) ... [2024-11-12 03:27:10,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:09" (1/1) ... [2024-11-12 03:27:10,078 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2024-11-12 03:27:10,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:27:10,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:27:10,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:27:10,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:27:10,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:09" (1/1) ... [2024-11-12 03:27:10,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:09" (1/1) ... [2024-11-12 03:27:10,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:09" (1/1) ... [2024-11-12 03:27:10,140 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 03:27:10,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:09" (1/1) ... [2024-11-12 03:27:10,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:09" (1/1) ... [2024-11-12 03:27:10,167 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:09" (1/1) ... [2024-11-12 03:27:10,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:09" (1/1) ... [2024-11-12 03:27:10,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:09" (1/1) ... [2024-11-12 03:27:10,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:09" (1/1) ... [2024-11-12 03:27:10,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:27:10,222 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:27:10,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:27:10,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:27:10,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:09" (1/1) ... [2024-11-12 03:27:10,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:27:10,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:27:10,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 03:27:10,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 03:27:10,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:27:10,317 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:27:10,318 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:27:10,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 03:27:10,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:27:10,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:27:10,417 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:27:10,419 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:27:11,046 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-12 03:27:11,046 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:27:11,064 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:27:11,064 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:27:11,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:27:11 BoogieIcfgContainer [2024-11-12 03:27:11,065 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:27:11,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:27:11,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:27:11,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:27:11,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:27:09" (1/3) ... [2024-11-12 03:27:11,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f7ba49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:27:11, skipping insertion in model container [2024-11-12 03:27:11,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:09" (2/3) ... [2024-11-12 03:27:11,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f7ba49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:27:11, skipping insertion in model container [2024-11-12 03:27:11,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:27:11" (3/3) ... [2024-11-12 03:27:11,091 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-11-12 03:27:11,107 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:27:11,108 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:27:11,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:27:11,232 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;@5f64141c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:27:11,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:27:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 79 states have internal predecessors, (121), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 03:27:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-12 03:27:11,254 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:27:11,255 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:27:11,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:27:11,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:27:11,263 INFO L85 PathProgramCache]: Analyzing trace with hash -812728208, now seen corresponding path program 1 times [2024-11-12 03:27:11,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:27:11,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117886242] [2024-11-12 03:27:11,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:11,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:27:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:27:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:27:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:27:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:27:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:27:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:27:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:27:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:27:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:27:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:27:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:27:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:27:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:27:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:27:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:27:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:27:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:27:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:27:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:27:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:27:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:27:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 42 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-12 03:27:12,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:27:12,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117886242] [2024-11-12 03:27:12,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117886242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:27:12,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622065497] [2024-11-12 03:27:12,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:12,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:27:12,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:27:12,563 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-12 03:27:12,565 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-12 03:27:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:12,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 03:27:12,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:27:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 422 proven. 63 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2024-11-12 03:27:13,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:27:13,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622065497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:27:13,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 03:27:13,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 12 [2024-11-12 03:27:13,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151338992] [2024-11-12 03:27:13,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 03:27:13,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 03:27:13,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:27:13,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 03:27:13,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-12 03:27:13,706 INFO L87 Difference]: Start difference. First operand has 102 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 79 states have internal predecessors, (121), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-12 03:27:15,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:27:15,160 INFO L93 Difference]: Finished difference Result 324 states and 560 transitions. [2024-11-12 03:27:15,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-12 03:27:15,163 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 145 [2024-11-12 03:27:15,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:27:15,176 INFO L225 Difference]: With dead ends: 324 [2024-11-12 03:27:15,177 INFO L226 Difference]: Without dead ends: 225 [2024-11-12 03:27:15,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=493, Invalid=1669, Unknown=0, NotChecked=0, Total=2162 [2024-11-12 03:27:15,190 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 601 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 03:27:15,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 511 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 03:27:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-12 03:27:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 140. [2024-11-12 03:27:15,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 96 states have internal predecessors, (118), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-12 03:27:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2024-11-12 03:27:15,269 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 145 [2024-11-12 03:27:15,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:27:15,271 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2024-11-12 03:27:15,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-12 03:27:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2024-11-12 03:27:15,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-12 03:27:15,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:27:15,275 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:27:15,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 03:27:15,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-12 03:27:15,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:27:15,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:27:15,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1657699660, now seen corresponding path program 1 times [2024-11-12 03:27:15,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:27:15,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795912767] [2024-11-12 03:27:15,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:15,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:27:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:27:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:27:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:27:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:27:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:27:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:27:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:27:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:27:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:27:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:27:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:27:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:27:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:27:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:27:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:27:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:27:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:27:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:27:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:27:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:27:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:27:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 81 proven. 81 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-12 03:27:16,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:27:16,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795912767] [2024-11-12 03:27:16,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795912767] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:27:16,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925464056] [2024-11-12 03:27:16,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:16,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:27:16,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:27:16,444 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-12 03:27:16,446 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-12 03:27:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 03:27:16,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:27:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 563 proven. 111 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-12 03:27:17,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:27:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 81 proven. 90 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2024-11-12 03:27:18,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925464056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:27:18,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:27:18,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 13] total 31 [2024-11-12 03:27:18,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379641374] [2024-11-12 03:27:18,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:27:18,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-12 03:27:18,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:27:18,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-12 03:27:18,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2024-11-12 03:27:18,344 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand has 31 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 31 states have internal predecessors, (111), 10 states have call successors, (49), 5 states have call predecessors, (49), 11 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) [2024-11-12 03:27:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:27:21,236 INFO L93 Difference]: Finished difference Result 425 states and 543 transitions. [2024-11-12 03:27:21,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-12 03:27:21,241 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 31 states have internal predecessors, (111), 10 states have call successors, (49), 5 states have call predecessors, (49), 11 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) Word has length 145 [2024-11-12 03:27:21,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:27:21,248 INFO L225 Difference]: With dead ends: 425 [2024-11-12 03:27:21,251 INFO L226 Difference]: Without dead ends: 322 [2024-11-12 03:27:21,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2251 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1745, Invalid=5911, Unknown=0, NotChecked=0, Total=7656 [2024-11-12 03:27:21,257 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 1250 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:27:21,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 512 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 03:27:21,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-12 03:27:21,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 184. [2024-11-12 03:27:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 130 states have (on average 1.2) internal successors, (156), 131 states have internal predecessors, (156), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-12 03:27:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 230 transitions. [2024-11-12 03:27:21,298 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 230 transitions. Word has length 145 [2024-11-12 03:27:21,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:27:21,299 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 230 transitions. [2024-11-12 03:27:21,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 31 states have internal predecessors, (111), 10 states have call successors, (49), 5 states have call predecessors, (49), 11 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) [2024-11-12 03:27:21,300 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 230 transitions. [2024-11-12 03:27:21,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-12 03:27:21,302 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:27:21,302 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:27:21,319 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-12 03:27:21,503 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,SelfDestructingSolverStorable1 [2024-11-12 03:27:21,503 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:27:21,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:27:21,504 INFO L85 PathProgramCache]: Analyzing trace with hash -309311703, now seen corresponding path program 1 times [2024-11-12 03:27:21,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:27:21,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890615831] [2024-11-12 03:27:21,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:21,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:27:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:27:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:27:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:27:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:27:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:27:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:27:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:27:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:27:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:27:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:27:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:27:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:27:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:27:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:27:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:27:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:27:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:27:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:27:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:27:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:27:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:27:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,289 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 81 proven. 81 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-12 03:27:22,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:27:22,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890615831] [2024-11-12 03:27:22,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890615831] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:27:22,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504894457] [2024-11-12 03:27:22,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:22,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:27:22,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:27:22,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:27:22,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 03:27:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:22,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 03:27:22,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:27:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 476 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-12 03:27:22,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:27:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 42 proven. 75 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2024-11-12 03:27:23,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504894457] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:27:23,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:27:23,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 23 [2024-11-12 03:27:23,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508163029] [2024-11-12 03:27:23,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:27:23,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-12 03:27:23,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:27:23,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-12 03:27:23,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-12 03:27:23,249 INFO L87 Difference]: Start difference. First operand 184 states and 230 transitions. Second operand has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 8 states have call successors, (49), 3 states have call predecessors, (49), 7 states have return successors, (50), 8 states have call predecessors, (50), 8 states have call successors, (50) [2024-11-12 03:27:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:27:24,303 INFO L93 Difference]: Finished difference Result 335 states and 416 transitions. [2024-11-12 03:27:24,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-12 03:27:24,304 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 8 states have call successors, (49), 3 states have call predecessors, (49), 7 states have return successors, (50), 8 states have call predecessors, (50), 8 states have call successors, (50) Word has length 146 [2024-11-12 03:27:24,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:27:24,310 INFO L225 Difference]: With dead ends: 335 [2024-11-12 03:27:24,310 INFO L226 Difference]: Without dead ends: 208 [2024-11-12 03:27:24,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=543, Invalid=1619, Unknown=0, NotChecked=0, Total=2162 [2024-11-12 03:27:24,312 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 592 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 03:27:24,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 340 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 03:27:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-12 03:27:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2024-11-12 03:27:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 135 states have (on average 1.1851851851851851) internal successors, (160), 136 states have internal predecessors, (160), 37 states have call successors, (37), 18 states have call predecessors, (37), 18 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-12 03:27:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 234 transitions. [2024-11-12 03:27:24,344 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 234 transitions. Word has length 146 [2024-11-12 03:27:24,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:27:24,344 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 234 transitions. [2024-11-12 03:27:24,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 8 states have call successors, (49), 3 states have call predecessors, (49), 7 states have return successors, (50), 8 states have call predecessors, (50), 8 states have call successors, (50) [2024-11-12 03:27:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 234 transitions. [2024-11-12 03:27:24,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-12 03:27:24,351 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:27:24,351 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:27:24,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 03:27:24,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:27:24,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:27:24,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:27:24,553 INFO L85 PathProgramCache]: Analyzing trace with hash -896117717, now seen corresponding path program 1 times [2024-11-12 03:27:24,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:27:24,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041308652] [2024-11-12 03:27:24,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:24,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:27:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:27:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:27:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:27:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:27:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:27:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:27:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:27:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:27:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:27:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:27:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:27:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:27:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:27:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:27:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:27:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:27:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:27:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:27:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:27:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:27:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:27:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,430 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-12 03:27:25,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:27:25,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041308652] [2024-11-12 03:27:25,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041308652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:27:25,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50064426] [2024-11-12 03:27:25,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:25,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:27:25,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:27:25,433 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:27:25,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 03:27:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:25,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 03:27:25,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:27:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 555 proven. 132 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-12 03:27:26,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:27:27,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50064426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:27:27,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 03:27:27,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18] total 22 [2024-11-12 03:27:27,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282355581] [2024-11-12 03:27:27,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 03:27:27,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 03:27:27,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:27:27,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 03:27:27,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2024-11-12 03:27:27,689 INFO L87 Difference]: Start difference. First operand 191 states and 234 transitions. Second operand has 22 states, 22 states have (on average 3.909090909090909) internal successors, (86), 21 states have internal predecessors, (86), 9 states have call successors, (35), 6 states have call predecessors, (35), 10 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2024-11-12 03:27:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:27:28,606 INFO L93 Difference]: Finished difference Result 337 states and 415 transitions. [2024-11-12 03:27:28,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-12 03:27:28,606 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.909090909090909) internal successors, (86), 21 states have internal predecessors, (86), 9 states have call successors, (35), 6 states have call predecessors, (35), 10 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) Word has length 146 [2024-11-12 03:27:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:27:28,608 INFO L225 Difference]: With dead ends: 337 [2024-11-12 03:27:28,608 INFO L226 Difference]: Without dead ends: 207 [2024-11-12 03:27:28,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=744, Invalid=2448, Unknown=0, NotChecked=0, Total=3192 [2024-11-12 03:27:28,611 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 319 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 03:27:28,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 392 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 03:27:28,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-12 03:27:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 191. [2024-11-12 03:27:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 135 states have (on average 1.1703703703703703) internal successors, (158), 136 states have internal predecessors, (158), 37 states have call successors, (37), 18 states have call predecessors, (37), 18 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-12 03:27:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 232 transitions. [2024-11-12 03:27:28,642 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 232 transitions. Word has length 146 [2024-11-12 03:27:28,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:27:28,643 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 232 transitions. [2024-11-12 03:27:28,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.909090909090909) internal successors, (86), 21 states have internal predecessors, (86), 9 states have call successors, (35), 6 states have call predecessors, (35), 10 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2024-11-12 03:27:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 232 transitions. [2024-11-12 03:27:28,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-12 03:27:28,645 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:27:28,645 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:27:28,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 03:27:28,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:27:28,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:27:28,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:27:28,850 INFO L85 PathProgramCache]: Analyzing trace with hash -55985574, now seen corresponding path program 1 times [2024-11-12 03:27:28,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:27:28,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472495520] [2024-11-12 03:27:28,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:28,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:27:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:27:28,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403390582] [2024-11-12 03:27:28,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:28,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:27:28,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:27:28,922 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:27:28,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 03:27:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:27:29,066 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 03:27:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:27:29,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 03:27:29,284 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 03:27:29,286 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 03:27:29,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 03:27:29,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:27:29,492 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 03:27:29,611 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 03:27:29,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 03:27:29 BoogieIcfgContainer [2024-11-12 03:27:29,615 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 03:27:29,615 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 03:27:29,615 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 03:27:29,616 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 03:27:29,616 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:27:11" (3/4) ... [2024-11-12 03:27:29,620 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 03:27:29,621 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 03:27:29,622 INFO L158 Benchmark]: Toolchain (without parser) took 20083.19ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 109.2MB in the beginning and 203.1MB in the end (delta: -94.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 03:27:29,622 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 115.3MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:27:29,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.66ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 91.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 03:27:29,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.08ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 84.8MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 03:27:29,623 INFO L158 Benchmark]: Boogie Preprocessor took 141.92ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 75.6MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 03:27:29,623 INFO L158 Benchmark]: RCFGBuilder took 842.74ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 37.9MB in the end (delta: 37.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-12 03:27:29,624 INFO L158 Benchmark]: TraceAbstraction took 18531.98ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 110.4MB in the beginning and 203.1MB in the end (delta: -92.7MB). Peak memory consumption was 151.5MB. Max. memory is 16.1GB. [2024-11-12 03:27:29,624 INFO L158 Benchmark]: Witness Printer took 6.15ms. Allocated memory is still 249.6MB. Free memory is still 203.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:27:29,625 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 115.3MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.66ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 91.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.08ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 84.8MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 141.92ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 75.6MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 842.74ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 37.9MB in the end (delta: 37.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18531.98ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 110.4MB in the beginning and 203.1MB in the end (delta: -92.7MB). Peak memory consumption was 151.5MB. Max. memory is 16.1GB. * Witness Printer took 6.15ms. Allocated memory is still 249.6MB. Free memory is still 203.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryArithmeticFLOAToperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -25; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1230640054; [L25] signed long int var_1_6 = 1508873667; [L26] unsigned char var_1_7 = 64; [L27] unsigned char var_1_8 = 200; [L28] unsigned char var_1_9 = 16; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_11 = 8; [L31] float var_1_12 = 15.4; [L32] float var_1_16 = 10000000000000.375; [L33] float var_1_17 = 16.4; [L34] float var_1_18 = 8.5; [L35] float var_1_19 = 64.75; [L36] unsigned char var_1_20 = 16; [L37] signed char var_1_22 = 0; [L38] unsigned char var_1_23 = 16; [L39] unsigned char var_1_24 = 128; [L40] signed short int var_1_30 = -256; [L41] signed short int var_1_31 = 2; [L42] signed short int var_1_34 = -2; [L43] signed short int var_1_36 = -50; [L44] unsigned char var_1_37 = 4; [L45] unsigned char var_1_38 = 64; [L46] float var_1_40 = 0.8; [L47] signed short int var_1_44 = 1; [L48] signed long int var_1_45 = 4; [L49] float var_1_46 = 1000000000000.375; VAL [isInitial=0, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L160] isInitial = 1 [L161] FCALL initially() [L162] COND TRUE 1 [L163] FCALL updateLastVariables() [L164] CALL updateVariables() [L120] var_1_2 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L121] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L122] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L122] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L123] var_1_3 = __VERIFIER_nondet_long() [L124] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L124] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L125] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L125] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L126] var_1_6 = __VERIFIER_nondet_long() [L127] CALL assume_abort_if_not(var_1_6 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L127] RET assume_abort_if_not(var_1_6 >= 1073741822) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L128] CALL assume_abort_if_not(var_1_6 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L128] RET assume_abort_if_not(var_1_6 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L129] var_1_8 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_8 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=16] [L130] RET assume_abort_if_not(var_1_8 >= 190) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=16] [L131] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=16] [L131] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=16] [L132] var_1_9 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578] [L133] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578] [L134] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L134] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L135] var_1_10 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L136] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L137] CALL assume_abort_if_not(var_1_10 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L137] RET assume_abort_if_not(var_1_10 <= 32) VAL [isInitial=1, var_1_10=256, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L138] var_1_11 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L139] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L140] CALL assume_abort_if_not(var_1_11 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L140] RET assume_abort_if_not(var_1_11 <= 31) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L141] var_1_17 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L142] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L143] var_1_18 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L144] RET assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L145] var_1_20 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_20 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L146] RET assume_abort_if_not(var_1_20 >= 1) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L147] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L147] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L148] CALL assume_abort_if_not(var_1_20 != 127) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L148] RET assume_abort_if_not(var_1_20 != 127) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L149] var_1_38 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_38 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L150] RET assume_abort_if_not(var_1_38 >= 63) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L151] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L151] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L164] RET updateVariables() [L165] CALL step() [L53] var_1_7 = ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11))) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L54] COND FALSE !(1 >= var_1_3) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L59] COND TRUE \read(var_1_2) [L60] var_1_45 = (((((var_1_10 + var_1_38)) < (var_1_10)) ? ((var_1_10 + var_1_38)) : (var_1_10))) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L62] var_1_16 = (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L63] COND FALSE !((3886175339u - var_1_20) <= (var_1_9 / var_1_3)) [L70] var_1_23 = var_1_20 VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L72] COND FALSE !(((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) < var_1_17) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L77] COND TRUE \read(var_1_2) [L78] var_1_1 = ((var_1_3 - var_1_7) - var_1_7) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L82] var_1_30 = var_1_8 [L83] var_1_46 = var_1_17 [L84] signed long int stepLocal_1 = var_1_9 % (var_1_8 - var_1_20); VAL [isInitial=1, stepLocal_1=0, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L85] EXPR var_1_7 ^ var_1_10 VAL [isInitial=1, stepLocal_1=0, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L85] signed long int stepLocal_0 = var_1_7 ^ var_1_10; [L86] COND FALSE !(stepLocal_1 > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) VAL [isInitial=1, stepLocal_0=90, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L91] EXPR var_1_9 & var_1_9 VAL [isInitial=1, stepLocal_0=90, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L91] COND FALSE !(var_1_8 <= (var_1_9 & var_1_9)) [L94] COND TRUE (var_1_11 % var_1_20) < var_1_1 [L95] var_1_22 = ((((10) > (var_1_10)) ? (10) : (var_1_10))) VAL [isInitial=1, stepLocal_0=90, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L97] COND TRUE \read(var_1_2) [L98] var_1_40 = ((((var_1_17) > ((var_1_18 + var_1_17))) ? (var_1_17) : ((var_1_18 + var_1_17)))) VAL [isInitial=1, stepLocal_0=90, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L100] COND TRUE ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f)) [L101] var_1_12 = 31.5f VAL [isInitial=1, stepLocal_0=90, var_1_10=256, var_1_11=-256, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L103] COND TRUE (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) >= (var_1_20 % var_1_20)) || var_1_2 [L104] var_1_24 = ((((var_1_8 - 8) < 0 ) ? -(var_1_8 - 8) : (var_1_8 - 8))) VAL [isInitial=1, stepLocal_0=90, var_1_10=256, var_1_11=-256, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L108] COND TRUE var_1_3 >= ((((32) > (var_1_8)) ? (32) : (var_1_8))) [L109] var_1_37 = (var_1_8 - (var_1_38 - var_1_9)) VAL [isInitial=1, stepLocal_0=90, var_1_10=256, var_1_11=-256, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=127, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L113] COND FALSE !(var_1_17 != var_1_19) VAL [isInitial=1, stepLocal_0=90, var_1_10=256, var_1_11=-256, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=127, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L165] RET step() [L166] CALL, EXPR property() [L156] EXPR ((((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_7) - var_1_7))) : (var_1_1 == ((signed long int) (((((var_1_3) > ((var_1_6 - var_1_7))) ? (var_1_3) : ((var_1_6 - var_1_7)))) - var_1_7)))) && (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11)))))) && ((((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f))) ? (var_1_12 == ((float) 31.5f)) : 1)) && (var_1_16 == ((float) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))) && (((var_1_9 % (var_1_8 - var_1_20)) > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) ? (((var_1_3 ^ var_1_23) <= (var_1_7 ^ var_1_10)) ? (var_1_19 == ((float) var_1_17)) : 1) : 1) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=127, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L156-L157] return ((((((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_7) - var_1_7))) : (var_1_1 == ((signed long int) (((((var_1_3) > ((var_1_6 - var_1_7))) ? (var_1_3) : ((var_1_6 - var_1_7)))) - var_1_7)))) && (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11)))))) && ((((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f))) ? (var_1_12 == ((float) 31.5f)) : 1)) && (var_1_16 == ((float) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))) && (((var_1_9 % (var_1_8 - var_1_20)) > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) ? (((var_1_3 ^ var_1_23) <= (var_1_7 ^ var_1_10)) ? (var_1_19 == ((float) var_1_17)) : 1) : 1)) && (((var_1_11 % var_1_20) < var_1_1) ? (var_1_22 == ((signed char) ((((10) > (var_1_10)) ? (10) : (var_1_10))))) : 1)) && (((3886175339u - var_1_20) <= (var_1_9 / var_1_3)) ? ((var_1_10 > var_1_7) ? (var_1_23 == ((unsigned char) ((((var_1_20) < ((var_1_8 - var_1_9))) ? (var_1_20) : ((var_1_8 - var_1_9)))))) : (var_1_23 == ((unsigned char) (((((var_1_20) > (64)) ? (var_1_20) : (64))) + var_1_11)))) : (var_1_23 == ((unsigned char) var_1_20))) ; [L166] RET, EXPR property() [L166] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=127, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L19] reach_error() VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=127, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.3s, OverallIterations: 5, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2765 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2762 mSDsluCounter, 1755 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1399 mSDsCounter, 760 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2648 IncrementalHoareTripleChecker+Invalid, 3408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 760 mSolverCounterUnsat, 356 mSDtfsCounter, 2648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1349 GetRequests, 1118 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4031 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=3, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 256 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 1456 NumberOfCodeBlocks, 1456 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1445 ConstructedInterpolants, 0 QuantifiedInterpolants, 8951 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1392 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 10 InterpolantComputations, 0 PerfectInterpolantSequences, 7521/8400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 03:27:29,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.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 654542981f55ac0dfa4ff9a5a73c4558ad4f81f278b418004930bd889a962b4b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:27:32,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:27:32,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 03:27:32,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:27:32,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:27:32,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:27:32,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:27:32,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:27:32,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:27:32,157 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:27:32,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:27:32,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:27:32,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:27:32,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:27:32,160 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:27:32,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:27:32,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:27:32,161 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:27:32,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:27:32,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:27:32,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:27:32,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:27:32,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:27:32,166 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 03:27:32,166 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 03:27:32,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:27:32,167 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 03:27:32,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:27:32,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:27:32,168 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:27:32,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:27:32,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:27:32,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:27:32,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:27:32,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:27:32,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:27:32,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:27:32,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:27:32,173 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 03:27:32,173 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 03:27:32,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:27:32,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:27:32,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:27:32,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:27:32,175 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 -> 654542981f55ac0dfa4ff9a5a73c4558ad4f81f278b418004930bd889a962b4b [2024-11-12 03:27:32,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:27:32,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:27:32,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:27:32,571 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:27:32,571 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:27:32,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-11-12 03:27:34,186 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:27:34,412 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:27:34,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-11-12 03:27:34,433 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc58312d/b23b685ba2ea462fa3c841af901e3fd7/FLAG62ec090f0 [2024-11-12 03:27:34,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc58312d/b23b685ba2ea462fa3c841af901e3fd7 [2024-11-12 03:27:34,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:27:34,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:27:34,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:27:34,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:27:34,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:27:34,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:27:34" (1/1) ... [2024-11-12 03:27:34,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f628ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:34, skipping insertion in model container [2024-11-12 03:27:34,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:27:34" (1/1) ... [2024-11-12 03:27:34,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:27:34,710 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_fillercode_fillercodestructure_filler-pr-ci_file-83.i[919,932] [2024-11-12 03:27:34,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:27:34,821 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:27:34,834 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_fillercode_fillercodestructure_filler-pr-ci_file-83.i[919,932] [2024-11-12 03:27:34,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:27:34,908 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:27:34,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:34 WrapperNode [2024-11-12 03:27:34,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:27:34,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:27:34,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:27:34,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:27:34,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:34" (1/1) ... [2024-11-12 03:27:34,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:34" (1/1) ... [2024-11-12 03:27:34,975 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-11-12 03:27:34,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:27:34,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:27:34,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:27:34,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:27:34,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:34" (1/1) ... [2024-11-12 03:27:34,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:34" (1/1) ... [2024-11-12 03:27:34,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:34" (1/1) ... [2024-11-12 03:27:35,012 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 03:27:35,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:34" (1/1) ... [2024-11-12 03:27:35,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:34" (1/1) ... [2024-11-12 03:27:35,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:34" (1/1) ... [2024-11-12 03:27:35,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:34" (1/1) ... [2024-11-12 03:27:35,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:34" (1/1) ... [2024-11-12 03:27:35,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:34" (1/1) ... [2024-11-12 03:27:35,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:27:35,038 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:27:35,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:27:35,039 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:27:35,039 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:34" (1/1) ... [2024-11-12 03:27:35,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:27:35,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:27:35,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 03:27:35,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 03:27:35,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:27:35,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 03:27:35,130 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:27:35,130 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:27:35,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:27:35,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:27:35,218 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:27:35,221 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:27:38,057 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 03:27:38,057 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:27:38,075 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:27:38,075 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:27:38,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:27:38 BoogieIcfgContainer [2024-11-12 03:27:38,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:27:38,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:27:38,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:27:38,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:27:38,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:27:34" (1/3) ... [2024-11-12 03:27:38,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f932be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:27:38, skipping insertion in model container [2024-11-12 03:27:38,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:34" (2/3) ... [2024-11-12 03:27:38,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f932be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:27:38, skipping insertion in model container [2024-11-12 03:27:38,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:27:38" (3/3) ... [2024-11-12 03:27:38,089 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-11-12 03:27:38,103 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:27:38,103 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:27:38,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:27:38,178 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;@4338daf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:27:38,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:27:38,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 48 states have internal predecessors, (70), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 03:27:38,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 03:27:38,193 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:27:38,194 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:27:38,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:27:38,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:27:38,199 INFO L85 PathProgramCache]: Analyzing trace with hash -842358286, now seen corresponding path program 1 times [2024-11-12 03:27:38,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:27:38,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985569117] [2024-11-12 03:27:38,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:38,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:27:38,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:27:38,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:27:38,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 03:27:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:38,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 03:27:38,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:27:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-12 03:27:38,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:27:38,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:27:38,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985569117] [2024-11-12 03:27:38,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985569117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:27:38,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:27:38,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:27:38,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860303000] [2024-11-12 03:27:38,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:27:38,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:27:38,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:27:38,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:27:38,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:27:38,807 INFO L87 Difference]: Start difference. First operand has 71 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 48 states have internal predecessors, (70), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-12 03:27:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:27:38,840 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2024-11-12 03:27:38,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:27:38,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 140 [2024-11-12 03:27:38,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:27:38,851 INFO L225 Difference]: With dead ends: 134 [2024-11-12 03:27:38,851 INFO L226 Difference]: Without dead ends: 66 [2024-11-12 03:27:38,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:27:38,861 INFO L435 NwaCegarLoop]: 101 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, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:27:38,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:27:38,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-12 03:27:38,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-12 03:27:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 03:27:38,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 101 transitions. [2024-11-12 03:27:38,927 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 101 transitions. Word has length 140 [2024-11-12 03:27:38,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:27:38,928 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 101 transitions. [2024-11-12 03:27:38,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-12 03:27:38,928 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 101 transitions. [2024-11-12 03:27:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 03:27:38,932 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:27:38,932 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:27:38,946 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-12 03:27:39,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:27:39,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:27:39,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:27:39,134 INFO L85 PathProgramCache]: Analyzing trace with hash 169221484, now seen corresponding path program 1 times [2024-11-12 03:27:39,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:27:39,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517721889] [2024-11-12 03:27:39,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:39,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:27:39,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:27:39,140 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:27:39,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 03:27:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:39,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 03:27:39,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:27:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 476 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-12 03:27:41,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:27:42,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:27:42,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517721889] [2024-11-12 03:27:42,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517721889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:27:42,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1183025944] [2024-11-12 03:27:42,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:42,108 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 03:27:42,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 03:27:42,111 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-12 03:27:42,113 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-12 03:27:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:42,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 03:27:42,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:27:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-12 03:27:42,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:27:42,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1183025944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:27:42,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 03:27:42,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-12 03:27:42,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831832558] [2024-11-12 03:27:42,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:27:42,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:27:42,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:27:42,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:27:42,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-12 03:27:42,571 INFO L87 Difference]: Start difference. First operand 66 states and 101 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-12 03:27:43,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:27:43,451 INFO L93 Difference]: Finished difference Result 153 states and 235 transitions. [2024-11-12 03:27:43,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:27:43,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2024-11-12 03:27:43,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:27:43,488 INFO L225 Difference]: With dead ends: 153 [2024-11-12 03:27:43,488 INFO L226 Difference]: Without dead ends: 90 [2024-11-12 03:27:43,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-12 03:27:43,490 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 30 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 03:27:43,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 184 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 03:27:43,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-12 03:27:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 77. [2024-11-12 03:27:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 03:27:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 118 transitions. [2024-11-12 03:27:43,502 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 118 transitions. Word has length 140 [2024-11-12 03:27:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:27:43,503 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 118 transitions. [2024-11-12 03:27:43,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-12 03:27:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2024-11-12 03:27:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 03:27:43,506 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:27:43,506 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:27:43,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-12 03:27:43,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 03:27:43,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:27:43,907 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:27:43,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:27:43,908 INFO L85 PathProgramCache]: Analyzing trace with hash 849279854, now seen corresponding path program 1 times [2024-11-12 03:27:43,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:27:43,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787993607] [2024-11-12 03:27:43,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:43,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:27:43,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:27:43,915 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:27:43,916 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 (5)] Waiting until timeout for monitored process [2024-11-12 03:27:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:44,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 03:27:44,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:27:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 476 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-12 03:27:46,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:27:46,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:27:46,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787993607] [2024-11-12 03:27:46,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787993607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:27:46,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [379364750] [2024-11-12 03:27:46,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:46,588 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 03:27:46,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 03:27:46,591 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 03:27:46,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-12 03:27:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:47,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 03:27:47,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:27:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 476 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-12 03:27:48,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:27:49,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [379364750] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:27:49,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 03:27:49,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-12 03:27:49,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268090558] [2024-11-12 03:27:49,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 03:27:49,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 03:27:49,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:27:49,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 03:27:49,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-12 03:27:49,389 INFO L87 Difference]: Start difference. First operand 77 states and 118 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-12 03:27:51,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:27:51,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:27:51,564 INFO L93 Difference]: Finished difference Result 163 states and 243 transitions. [2024-11-12 03:27:51,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 03:27:51,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 140 [2024-11-12 03:27:51,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:27:51,592 INFO L225 Difference]: With dead ends: 163 [2024-11-12 03:27:51,592 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 03:27:51,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-11-12 03:27:51,599 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 46 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:27:51,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 156 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 03:27:51,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 03:27:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-11-12 03:27:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 03:27:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2024-11-12 03:27:51,621 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 140 [2024-11-12 03:27:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:27:51,621 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-11-12 03:27:51,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-12 03:27:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2024-11-12 03:27:51,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 03:27:51,625 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:27:51,626 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:27:51,642 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 (5)] Ended with exit code 0 [2024-11-12 03:27:51,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-12 03:27:52,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 03:27:52,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:27:52,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:27:52,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1550344432, now seen corresponding path program 1 times [2024-11-12 03:27:52,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:27:52,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77359427] [2024-11-12 03:27:52,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:52,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:27:52,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:27:52,030 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:27:52,031 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 (7)] Waiting until timeout for monitored process [2024-11-12 03:27:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:52,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 03:27:52,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:27:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 362 proven. 93 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-11-12 03:27:53,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:27:55,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:27:55,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77359427] [2024-11-12 03:27:55,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77359427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:27:55,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1301676388] [2024-11-12 03:27:55,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:55,560 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 03:27:55,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 03:27:55,563 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 03:27:55,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-12 03:27:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:57,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 03:27:57,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:27:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 362 proven. 93 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-11-12 03:27:59,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:28:00,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1301676388] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:28:00,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 03:28:00,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-12 03:28:00,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832137809] [2024-11-12 03:28:00,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 03:28:00,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 03:28:00,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:28:00,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 03:28:00,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-12 03:28:00,894 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-12 03:28:03,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:28:03,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:28:03,135 INFO L93 Difference]: Finished difference Result 176 states and 244 transitions. [2024-11-12 03:28:03,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 03:28:03,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 140 [2024-11-12 03:28:03,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:28:03,162 INFO L225 Difference]: With dead ends: 176 [2024-11-12 03:28:03,163 INFO L226 Difference]: Without dead ends: 94 [2024-11-12 03:28:03,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2024-11-12 03:28:03,164 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 49 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:28:03,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 167 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-12 03:28:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-12 03:28:03,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-11-12 03:28:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 63 states have internal predecessors, (76), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 03:28:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 118 transitions. [2024-11-12 03:28:03,175 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 118 transitions. Word has length 140 [2024-11-12 03:28:03,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:28:03,176 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 118 transitions. [2024-11-12 03:28:03,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-12 03:28:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 118 transitions. [2024-11-12 03:28:03,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 03:28:03,180 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:28:03,180 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:28:03,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-12 03:28:03,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-12 03:28:03,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 03:28:03,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:28:03,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:28:03,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1493086130, now seen corresponding path program 1 times [2024-11-12 03:28:03,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:28:03,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665493785] [2024-11-12 03:28:03,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:28:03,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:28:03,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:28:03,586 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:28:03,588 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 (9)] Waiting until timeout for monitored process [2024-11-12 03:28:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:28:04,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 03:28:04,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:28:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 350 proven. 15 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2024-11-12 03:28:19,979 INFO L312 TraceCheckSpWp]: Computing backward predicates...