./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.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 f02b4d764a6f2b9378677160d85f84fe71fe9bb12a30ec7a53966c7051db5504 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:31:09,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:31:09,728 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:31:09,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:31:09,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:31:09,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:31:09,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:31:09,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:31:09,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:31:09,767 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:31:09,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:31:09,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:31:09,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:31:09,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:31:09,770 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:31:09,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:31:09,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:31:09,771 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:31:09,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:31:09,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:31:09,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:31:09,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:31:09,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:31:09,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:31:09,774 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:31:09,774 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:31:09,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:31:09,775 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:31:09,775 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:31:09,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:31:09,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:31:09,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:31:09,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:31:09,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:31:09,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:31:09,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:31:09,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:31:09,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:31:09,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:31:09,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:31:09,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:31:09,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:31:09,780 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 -> f02b4d764a6f2b9378677160d85f84fe71fe9bb12a30ec7a53966c7051db5504 [2024-10-14 10:31:10,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:31:10,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:31:10,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:31:10,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:31:10,091 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:31:10,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-10-14 10:31:11,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:31:11,778 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:31:11,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-10-14 10:31:11,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2b297b38/216584aca4a640098864018761917304/FLAG87bfcae43 [2024-10-14 10:31:11,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2b297b38/216584aca4a640098864018761917304 [2024-10-14 10:31:11,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:31:11,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:31:11,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:31:11,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:31:11,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:31:11,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:31:11" (1/1) ... [2024-10-14 10:31:11,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79bfa3fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:11, skipping insertion in model container [2024-10-14 10:31:11,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:31:11" (1/1) ... [2024-10-14 10:31:11,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:31:11,999 WARN L248 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-ps-co_file-42.i[919,932] [2024-10-14 10:31:12,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:31:12,094 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:31:12,106 WARN L248 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-ps-co_file-42.i[919,932] [2024-10-14 10:31:12,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:31:12,163 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:31:12,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:12 WrapperNode [2024-10-14 10:31:12,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:31:12,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:31:12,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:31:12,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:31:12,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:12" (1/1) ... [2024-10-14 10:31:12,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:12" (1/1) ... [2024-10-14 10:31:12,232 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 207 [2024-10-14 10:31:12,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:31:12,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:31:12,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:31:12,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:31:12,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:12" (1/1) ... [2024-10-14 10:31:12,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:12" (1/1) ... [2024-10-14 10:31:12,256 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:12" (1/1) ... [2024-10-14 10:31:12,319 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-10-14 10:31:12,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:12" (1/1) ... [2024-10-14 10:31:12,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:12" (1/1) ... [2024-10-14 10:31:12,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:12" (1/1) ... [2024-10-14 10:31:12,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:12" (1/1) ... [2024-10-14 10:31:12,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:12" (1/1) ... [2024-10-14 10:31:12,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:12" (1/1) ... [2024-10-14 10:31:12,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:31:12,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:31:12,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:31:12,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:31:12,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:12" (1/1) ... [2024-10-14 10:31:12,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:31:12,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:31:12,407 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-10-14 10:31:12,411 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-10-14 10:31:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:31:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:31:12,454 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:31:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:31:12,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:31:12,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:31:12,530 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:31:12,532 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:31:12,985 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-14 10:31:12,985 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:31:13,043 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:31:13,043 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:31:13,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:31:13 BoogieIcfgContainer [2024-10-14 10:31:13,044 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:31:13,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:31:13,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:31:13,052 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:31:13,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:31:11" (1/3) ... [2024-10-14 10:31:13,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25faad57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:31:13, skipping insertion in model container [2024-10-14 10:31:13,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:12" (2/3) ... [2024-10-14 10:31:13,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25faad57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:31:13, skipping insertion in model container [2024-10-14 10:31:13,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:31:13" (3/3) ... [2024-10-14 10:31:13,057 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-10-14 10:31:13,074 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:31:13,074 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:31:13,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:31:13,154 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;@86dc291, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:31:13,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:31:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-14 10:31:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-14 10:31:13,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:13,179 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:31:13,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:13,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:13,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1696566966, now seen corresponding path program 1 times [2024-10-14 10:31:13,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:31:13,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507648500] [2024-10-14 10:31:13,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:13,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:31:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:31:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:31:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:31:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:31:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:31:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:31:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:31:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:31:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:31:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:31:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:31:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:31:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:31:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:31:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:31:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:31:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:31:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:31:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:31:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:31:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:31:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:31:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:31:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:31:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:31:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:31:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 10:31:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:31:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 10:31:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 10:31:13,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:31:13,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507648500] [2024-10-14 10:31:13,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507648500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:13,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:13,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:31:13,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629361926] [2024-10-14 10:31:13,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:13,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:31:13,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:31:13,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:31:13,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:31:13,789 INFO L87 Difference]: Start difference. First operand has 84 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-14 10:31:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:13,905 INFO L93 Difference]: Finished difference Result 165 states and 299 transitions. [2024-10-14 10:31:13,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:31:13,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2024-10-14 10:31:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:13,921 INFO L225 Difference]: With dead ends: 165 [2024-10-14 10:31:13,922 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 10:31:13,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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-10-14 10:31:13,934 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:13,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:31:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 10:31:13,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-14 10:31:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-14 10:31:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2024-10-14 10:31:13,991 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 129 transitions. Word has length 187 [2024-10-14 10:31:13,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:13,991 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 129 transitions. [2024-10-14 10:31:13,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-14 10:31:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 129 transitions. [2024-10-14 10:31:13,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-14 10:31:13,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:13,996 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:31:13,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:31:13,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:13,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:13,997 INFO L85 PathProgramCache]: Analyzing trace with hash 742667134, now seen corresponding path program 1 times [2024-10-14 10:31:13,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:31:13,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346965607] [2024-10-14 10:31:13,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:13,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:31:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:31:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:31:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:31:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:31:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:31:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:31:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:31:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:31:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:31:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:31:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:31:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:31:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:31:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:31:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:31:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:31:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:31:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:31:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:31:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:31:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:31:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:31:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:31:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:31:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:31:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:31:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 10:31:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:31:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 10:31:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 10:31:14,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:31:14,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346965607] [2024-10-14 10:31:14,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346965607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:14,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:14,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:31:14,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023886073] [2024-10-14 10:31:14,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:14,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:31:14,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:31:14,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:31:14,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:31:14,367 INFO L87 Difference]: Start difference. First operand 82 states and 129 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:31:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:14,446 INFO L93 Difference]: Finished difference Result 212 states and 332 transitions. [2024-10-14 10:31:14,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:31:14,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-14 10:31:14,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:14,450 INFO L225 Difference]: With dead ends: 212 [2024-10-14 10:31:14,450 INFO L226 Difference]: Without dead ends: 131 [2024-10-14 10:31:14,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:31:14,455 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 73 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:14,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 277 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:31:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-14 10:31:14,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2024-10-14 10:31:14,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-14 10:31:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 201 transitions. [2024-10-14 10:31:14,490 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 201 transitions. Word has length 187 [2024-10-14 10:31:14,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:14,492 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 201 transitions. [2024-10-14 10:31:14,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:31:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 201 transitions. [2024-10-14 10:31:14,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-14 10:31:14,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:14,499 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:31:14,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:31:14,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:14,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:14,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1251477572, now seen corresponding path program 1 times [2024-10-14 10:31:14,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:31:14,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540229768] [2024-10-14 10:31:14,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:14,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:31:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:31:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:31:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:31:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:31:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:31:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:31:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:31:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:31:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:31:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:31:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:31:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:31:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:31:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:31:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:31:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:31:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:31:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:31:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:31:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:14,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:31:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:31:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:31:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:31:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:31:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:31:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:31:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 10:31:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:31:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 10:31:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 10:31:15,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:31:15,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540229768] [2024-10-14 10:31:15,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540229768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:15,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:15,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:31:15,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867776511] [2024-10-14 10:31:15,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:15,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:31:15,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:31:15,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:31:15,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:31:15,069 INFO L87 Difference]: Start difference. First operand 128 states and 201 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:31:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:15,277 INFO L93 Difference]: Finished difference Result 361 states and 569 transitions. [2024-10-14 10:31:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:31:15,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-14 10:31:15,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:15,285 INFO L225 Difference]: With dead ends: 361 [2024-10-14 10:31:15,285 INFO L226 Difference]: Without dead ends: 234 [2024-10-14 10:31:15,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:31:15,288 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 101 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:15,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 369 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:31:15,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-14 10:31:15,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 196. [2024-10-14 10:31:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 123 states have internal predecessors, (167), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 10:31:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 307 transitions. [2024-10-14 10:31:15,329 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 307 transitions. Word has length 187 [2024-10-14 10:31:15,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:15,330 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 307 transitions. [2024-10-14 10:31:15,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:31:15,330 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 307 transitions. [2024-10-14 10:31:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-14 10:31:15,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:15,333 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:31:15,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:31:15,334 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:15,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:15,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1525232206, now seen corresponding path program 1 times [2024-10-14 10:31:15,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:31:15,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150125264] [2024-10-14 10:31:15,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:15,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:31:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:31:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:31:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:31:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:31:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:31:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:31:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:31:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:31:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:31:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:31:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:31:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:31:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:31:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:31:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:31:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:31:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:31:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:31:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:31:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:31:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:31:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:31:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:31:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:31:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:31:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:31:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 10:31:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:31:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 10:31:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:15,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 10:31:15,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:31:15,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150125264] [2024-10-14 10:31:15,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150125264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:15,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:15,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 10:31:15,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684601929] [2024-10-14 10:31:15,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:15,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:31:15,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:31:15,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:31:15,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:31:15,911 INFO L87 Difference]: Start difference. First operand 196 states and 307 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:31:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:16,325 INFO L93 Difference]: Finished difference Result 534 states and 838 transitions. [2024-10-14 10:31:16,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 10:31:16,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-14 10:31:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:16,332 INFO L225 Difference]: With dead ends: 534 [2024-10-14 10:31:16,334 INFO L226 Difference]: Without dead ends: 407 [2024-10-14 10:31:16,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 10:31:16,336 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 158 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:16,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 452 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 10:31:16,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-14 10:31:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 321. [2024-10-14 10:31:16,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 204 states have (on average 1.3823529411764706) internal successors, (282), 206 states have internal predecessors, (282), 111 states have call successors, (111), 5 states have call predecessors, (111), 5 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-14 10:31:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 504 transitions. [2024-10-14 10:31:16,430 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 504 transitions. Word has length 188 [2024-10-14 10:31:16,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:16,431 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 504 transitions. [2024-10-14 10:31:16,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:31:16,433 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 504 transitions. [2024-10-14 10:31:16,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-14 10:31:16,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:16,437 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:31:16,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 10:31:16,438 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:16,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:16,439 INFO L85 PathProgramCache]: Analyzing trace with hash 514114956, now seen corresponding path program 1 times [2024-10-14 10:31:16,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:31:16,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812344311] [2024-10-14 10:31:16,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:16,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:31:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:31:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:31:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:31:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:31:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:31:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:31:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:31:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:31:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:31:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:31:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:31:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:31:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:31:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:31:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:31:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:31:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:31:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:31:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:31:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:31:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:31:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:31:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:31:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:31:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:31:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:31:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 10:31:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:31:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 10:31:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 10:31:16,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:31:16,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812344311] [2024-10-14 10:31:16,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812344311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:16,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:16,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:31:16,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353918255] [2024-10-14 10:31:16,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:16,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:31:16,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:31:16,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:31:16,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:31:16,733 INFO L87 Difference]: Start difference. First operand 321 states and 504 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:31:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:16,788 INFO L93 Difference]: Finished difference Result 573 states and 901 transitions. [2024-10-14 10:31:16,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:31:16,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-14 10:31:16,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:16,792 INFO L225 Difference]: With dead ends: 573 [2024-10-14 10:31:16,793 INFO L226 Difference]: Without dead ends: 321 [2024-10-14 10:31:16,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:31:16,795 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:16,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 239 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:31:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-14 10:31:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-10-14 10:31:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 206 states have internal predecessors, (278), 111 states have call successors, (111), 5 states have call predecessors, (111), 5 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-14 10:31:16,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 500 transitions. [2024-10-14 10:31:16,863 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 500 transitions. Word has length 188 [2024-10-14 10:31:16,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:16,864 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 500 transitions. [2024-10-14 10:31:16,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:31:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 500 transitions. [2024-10-14 10:31:16,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-14 10:31:16,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:16,866 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:31:16,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 10:31:16,867 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:16,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash -295231670, now seen corresponding path program 1 times [2024-10-14 10:31:16,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:31:16,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372868397] [2024-10-14 10:31:16,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:16,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:31:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:31:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:31:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:31:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:31:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:31:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:31:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:31:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:31:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:31:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:31:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:31:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:31:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:31:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:31:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:31:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:31:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:31:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:31:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:31:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:31:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:31:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:31:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:31:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:31:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:31:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:31:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 10:31:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:31:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 10:31:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 36 proven. 48 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-14 10:31:17,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:31:17,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372868397] [2024-10-14 10:31:17,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372868397] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:31:17,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027140766] [2024-10-14 10:31:17,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:17,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:31:17,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:31:17,218 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-10-14 10:31:17,220 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-10-14 10:31:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:17,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 10:31:17,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 820 proven. 48 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2024-10-14 10:31:17,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:31:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 36 proven. 48 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-14 10:31:17,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027140766] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:31:17,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 10:31:17,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-14 10:31:17,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588224182] [2024-10-14 10:31:17,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 10:31:17,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 10:31:17,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:31:17,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 10:31:17,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:31:17,998 INFO L87 Difference]: Start difference. First operand 321 states and 500 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-14 10:31:18,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:18,254 INFO L93 Difference]: Finished difference Result 499 states and 767 transitions. [2024-10-14 10:31:18,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 10:31:18,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 188 [2024-10-14 10:31:18,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:18,258 INFO L225 Difference]: With dead ends: 499 [2024-10-14 10:31:18,258 INFO L226 Difference]: Without dead ends: 241 [2024-10-14 10:31:18,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 429 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-14 10:31:18,260 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 111 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:18,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 209 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:31:18,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-14 10:31:18,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2024-10-14 10:31:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 141 states have (on average 1.2695035460992907) internal successors, (179), 141 states have internal predecessors, (179), 87 states have call successors, (87), 6 states have call predecessors, (87), 6 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-14 10:31:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 353 transitions. [2024-10-14 10:31:18,293 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 353 transitions. Word has length 188 [2024-10-14 10:31:18,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:18,294 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 353 transitions. [2024-10-14 10:31:18,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-14 10:31:18,294 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 353 transitions. [2024-10-14 10:31:18,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-14 10:31:18,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:18,296 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:31:18,317 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-10-14 10:31:18,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 10:31:18,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:18,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:18,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2083606774, now seen corresponding path program 1 times [2024-10-14 10:31:18,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:31:18,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116569604] [2024-10-14 10:31:18,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:18,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:31:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:31:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:31:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:31:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:31:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:31:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:31:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:31:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:31:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:31:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:31:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:31:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:31:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:31:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:31:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:31:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:31:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:31:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:31:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:31:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:31:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:31:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:31:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:31:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:31:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:31:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:31:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 10:31:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:31:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 10:31:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 111 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2024-10-14 10:31:19,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:31:19,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116569604] [2024-10-14 10:31:19,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116569604] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:31:19,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753910052] [2024-10-14 10:31:19,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:19,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:31:19,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:31:19,252 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-10-14 10:31:19,256 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-10-14 10:31:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:19,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 10:31:19,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 863 proven. 111 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-10-14 10:31:20,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:31:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 114 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-10-14 10:31:21,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753910052] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:31:21,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 10:31:21,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 23 [2024-10-14 10:31:21,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519760921] [2024-10-14 10:31:21,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 10:31:21,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 10:31:21,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:31:21,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 10:31:21,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2024-10-14 10:31:21,233 INFO L87 Difference]: Start difference. First operand 235 states and 353 transitions. Second operand has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 6 states have call successors, (58), 4 states have call predecessors, (58), 9 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2024-10-14 10:31:24,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:24,272 INFO L93 Difference]: Finished difference Result 923 states and 1303 transitions. [2024-10-14 10:31:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-10-14 10:31:24,273 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 6 states have call successors, (58), 4 states have call predecessors, (58), 9 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) Word has length 188 [2024-10-14 10:31:24,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:24,280 INFO L225 Difference]: With dead ends: 923 [2024-10-14 10:31:24,281 INFO L226 Difference]: Without dead ends: 838 [2024-10-14 10:31:24,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 426 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3479 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1957, Invalid=8143, Unknown=0, NotChecked=0, Total=10100 [2024-10-14 10:31:24,287 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1044 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:24,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1263 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 10:31:24,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-10-14 10:31:24,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 359. [2024-10-14 10:31:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 226 states have (on average 1.252212389380531) internal successors, (283), 226 states have internal predecessors, (283), 116 states have call successors, (116), 16 states have call predecessors, (116), 16 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-10-14 10:31:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 515 transitions. [2024-10-14 10:31:24,368 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 515 transitions. Word has length 188 [2024-10-14 10:31:24,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:24,368 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 515 transitions. [2024-10-14 10:31:24,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 6 states have call successors, (58), 4 states have call predecessors, (58), 9 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2024-10-14 10:31:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 515 transitions. [2024-10-14 10:31:24,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-14 10:31:24,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:24,372 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:31:24,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 10:31:24,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-14 10:31:24,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:24,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:24,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1624554508, now seen corresponding path program 1 times [2024-10-14 10:31:24,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:31:24,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734217166] [2024-10-14 10:31:24,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:24,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:31:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:31:24,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1540746567] [2024-10-14 10:31:24,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:24,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:31:24,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:31:24,674 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-10-14 10:31:24,675 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-10-14 10:31:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:24,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 10:31:24,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-10-14 10:31:26,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:31:27,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:31:27,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734217166] [2024-10-14 10:31:27,524 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 10:31:27,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540746567] [2024-10-14 10:31:27,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540746567] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:31:27,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 10:31:27,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-14 10:31:27,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018718276] [2024-10-14 10:31:27,524 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 10:31:27,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 10:31:27,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:31:27,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 10:31:27,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-10-14 10:31:27,528 INFO L87 Difference]: Start difference. First operand 359 states and 515 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-14 10:31:28,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:28,558 INFO L93 Difference]: Finished difference Result 1064 states and 1502 transitions. [2024-10-14 10:31:28,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 10:31:28,559 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 188 [2024-10-14 10:31:28,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:28,565 INFO L225 Difference]: With dead ends: 1064 [2024-10-14 10:31:28,565 INFO L226 Difference]: Without dead ends: 777 [2024-10-14 10:31:28,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=466, Unknown=1, NotChecked=0, Total=650 [2024-10-14 10:31:28,568 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 115 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 72 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:28,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 849 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 604 Invalid, 8 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 10:31:28,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-10-14 10:31:28,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 647. [2024-10-14 10:31:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 411 states have (on average 1.2262773722627738) internal successors, (504), 411 states have internal predecessors, (504), 203 states have call successors, (203), 32 states have call predecessors, (203), 32 states have return successors, (203), 203 states have call predecessors, (203), 203 states have call successors, (203) [2024-10-14 10:31:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 910 transitions. [2024-10-14 10:31:28,668 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 910 transitions. Word has length 188 [2024-10-14 10:31:28,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:28,668 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 910 transitions. [2024-10-14 10:31:28,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-14 10:31:28,669 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 910 transitions. [2024-10-14 10:31:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-14 10:31:28,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:28,673 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:31:28,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 10:31:28,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:31:28,874 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:28,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:28,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1366389070, now seen corresponding path program 1 times [2024-10-14 10:31:28,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:31:28,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750721440] [2024-10-14 10:31:28,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:28,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:31:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:31:28,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1449062039] [2024-10-14 10:31:28,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:28,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:31:28,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:31:28,978 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-10-14 10:31:28,979 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-10-14 10:31:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:29,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 10:31:29,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-10-14 10:31:29,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:31:30,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:31:30,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750721440] [2024-10-14 10:31:30,485 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 10:31:30,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449062039] [2024-10-14 10:31:30,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449062039] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:31:30,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 10:31:30,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-10-14 10:31:30,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535738092] [2024-10-14 10:31:30,485 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 10:31:30,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 10:31:30,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:31:30,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 10:31:30,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=114, Unknown=2, NotChecked=0, Total=156 [2024-10-14 10:31:30,487 INFO L87 Difference]: Start difference. First operand 647 states and 910 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-14 10:31:31,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:31,277 INFO L93 Difference]: Finished difference Result 1162 states and 1614 transitions. [2024-10-14 10:31:31,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 10:31:31,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 188 [2024-10-14 10:31:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:31,285 INFO L225 Difference]: With dead ends: 1162 [2024-10-14 10:31:31,285 INFO L226 Difference]: Without dead ends: 979 [2024-10-14 10:31:31,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=387, Unknown=2, NotChecked=0, Total=552 [2024-10-14 10:31:31,289 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 149 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 77 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:31,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 666 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 497 Invalid, 8 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 10:31:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-10-14 10:31:31,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 875. [2024-10-14 10:31:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 565 states have (on average 1.2318584070796461) internal successors, (696), 567 states have internal predecessors, (696), 265 states have call successors, (265), 44 states have call predecessors, (265), 44 states have return successors, (265), 263 states have call predecessors, (265), 265 states have call successors, (265) [2024-10-14 10:31:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1226 transitions. [2024-10-14 10:31:31,500 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1226 transitions. Word has length 188 [2024-10-14 10:31:31,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:31,500 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1226 transitions. [2024-10-14 10:31:31,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-14 10:31:31,501 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1226 transitions. [2024-10-14 10:31:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-14 10:31:31,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:31,503 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:31:31,521 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-10-14 10:31:31,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:31:31,708 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:31,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:31,708 INFO L85 PathProgramCache]: Analyzing trace with hash 11550151, now seen corresponding path program 1 times [2024-10-14 10:31:31,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:31:31,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933928124] [2024-10-14 10:31:31,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:31,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:31:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:31:31,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1495038247] [2024-10-14 10:31:31,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:31,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:31:31,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:31:31,792 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-10-14 10:31:31,793 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-10-14 10:31:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:31:31,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 10:31:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:31:32,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 10:31:32,114 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 10:31:32,114 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 10:31:32,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 10:31:32,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 10:31:32,324 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:31:32,473 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 10:31:32,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:31:32 BoogieIcfgContainer [2024-10-14 10:31:32,477 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 10:31:32,478 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 10:31:32,478 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 10:31:32,478 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 10:31:32,478 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:31:13" (3/4) ... [2024-10-14 10:31:32,481 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 10:31:32,482 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 10:31:32,482 INFO L158 Benchmark]: Toolchain (without parser) took 20676.69ms. Allocated memory was 159.4MB in the beginning and 453.0MB in the end (delta: 293.6MB). Free memory was 85.8MB in the beginning and 233.0MB in the end (delta: -147.2MB). Peak memory consumption was 148.2MB. Max. memory is 16.1GB. [2024-10-14 10:31:32,483 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 159.4MB. Free memory was 110.2MB in the beginning and 110.1MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:31:32,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.50ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 68.9MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 10:31:32,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.59ms. Allocated memory is still 159.4MB. Free memory was 68.9MB in the beginning and 64.3MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 10:31:32,484 INFO L158 Benchmark]: Boogie Preprocessor took 131.33ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 64.3MB in the beginning and 174.9MB in the end (delta: -110.5MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-10-14 10:31:32,484 INFO L158 Benchmark]: RCFGBuilder took 675.78ms. Allocated memory is still 207.6MB. Free memory was 174.9MB in the beginning and 141.7MB in the end (delta: 33.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-14 10:31:32,484 INFO L158 Benchmark]: TraceAbstraction took 19430.90ms. Allocated memory was 207.6MB in the beginning and 453.0MB in the end (delta: 245.4MB). Free memory was 141.7MB in the beginning and 234.0MB in the end (delta: -92.3MB). Peak memory consumption was 153.0MB. Max. memory is 16.1GB. [2024-10-14 10:31:32,484 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 453.0MB. Free memory was 234.0MB in the beginning and 233.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:31:32,486 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.28ms. Allocated memory is still 159.4MB. Free memory was 110.2MB in the beginning and 110.1MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.50ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 68.9MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.59ms. Allocated memory is still 159.4MB. Free memory was 68.9MB in the beginning and 64.3MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 131.33ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 64.3MB in the beginning and 174.9MB in the end (delta: -110.5MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * RCFGBuilder took 675.78ms. Allocated memory is still 207.6MB. Free memory was 174.9MB in the beginning and 141.7MB in the end (delta: 33.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19430.90ms. Allocated memory was 207.6MB in the beginning and 453.0MB in the end (delta: 245.4MB). Free memory was 141.7MB in the beginning and 234.0MB in the end (delta: -92.3MB). Peak memory consumption was 153.0MB. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 453.0MB. Free memory was 234.0MB in the beginning and 233.0MB in the end (delta: 1.0MB). 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 200, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticFLOAToperation at line 65. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] unsigned char var_1_25 = 1; [L38] float var_1_26 = 500.65; [L39] signed long int var_1_27 = -8; [L40] float var_1_28 = 255.5; [L41] float var_1_29 = 7.5; [L42] float var_1_30 = 9.8; [L43] unsigned char var_1_31 = 4; [L44] unsigned char var_1_33 = 2; [L45] unsigned short int var_1_34 = 1; [L46] unsigned long int var_1_35 = 10; [L47] unsigned char var_1_36 = 10; [L48] unsigned char var_1_37 = 128; [L49] unsigned char var_1_38 = 16; [L50] unsigned char var_1_39 = 0; [L51] unsigned short int var_1_40 = 10; [L52] unsigned short int var_1_41 = 128; [L53] unsigned short int var_1_42 = 40597; [L54] signed short int last_1_var_1_1 = 16; [L55] unsigned char last_1_var_1_6 = 10; [L56] unsigned char last_1_var_1_8 = 1; [L57] signed short int last_1_var_1_13 = 200; [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L194] last_1_var_1_1 = var_1_1 [L195] last_1_var_1_6 = var_1_6 [L196] last_1_var_1_8 = var_1_8 [L197] last_1_var_1_13 = var_1_13 [L207] RET updateLastVariables() [L208] CALL updateVariables() [L147] var_1_5 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L148] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L149] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L150] var_1_7 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L151] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L152] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L153] var_1_11 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L154] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L155] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L155] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L156] var_1_12 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L157] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L158] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L159] var_1_15 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L160] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L161] var_1_16 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L162] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L163] var_1_20 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L164] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L165] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L165] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L166] var_1_25 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L167] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L168] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L169] var_1_27 = __VERIFIER_nondet_long() [L170] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L170] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L171] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L172] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L173] var_1_28 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L174] RET assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L175] var_1_29 = __VERIFIER_nondet_float() [L176] CALL assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L176] RET assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L177] var_1_33 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L178] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L179] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L179] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L180] var_1_37 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_37 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L181] RET assume_abort_if_not(var_1_37 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L182] CALL assume_abort_if_not(var_1_37 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L182] RET assume_abort_if_not(var_1_37 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L183] var_1_38 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L184] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L185] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L185] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L186] var_1_39 = __VERIFIER_nondet_uchar() [L187] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L187] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L188] CALL assume_abort_if_not(var_1_39 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L188] RET assume_abort_if_not(var_1_39 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L189] var_1_42 = __VERIFIER_nondet_ushort() [L190] CALL assume_abort_if_not(var_1_42 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L190] RET assume_abort_if_not(var_1_42 >= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L191] CALL assume_abort_if_not(var_1_42 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L191] RET assume_abort_if_not(var_1_42 <= 65534) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L208] RET updateVariables() [L209] CALL step() [L61] COND TRUE var_1_19 || var_1_8 [L62] var_1_21 = ((var_1_13 > -4) || var_1_25) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L64] COND TRUE ((var_1_13 + 25) % var_1_27) < 2 [L65] var_1_26 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) + var_1_29) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L67] COND TRUE (- var_1_28) < ((((var_1_14) > (var_1_29)) ? (var_1_14) : (var_1_29))) [L68] var_1_30 = var_1_29 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L70] COND TRUE ((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) < (var_1_13)) ? (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) : (var_1_13))) <= var_1_13 [L71] var_1_31 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L73] COND FALSE !(var_1_6 < ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L76] COND TRUE \read(var_1_25) [L77] var_1_35 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L79] COND TRUE \read(var_1_25) [L80] var_1_36 = (var_1_37 - var_1_38) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L84] COND TRUE (- var_1_17) != var_1_17 [L85] var_1_40 = var_1_39 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L87] COND FALSE !(var_1_33 <= (~ var_1_13)) [L92] var_1_41 = var_1_1 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L94] signed long int stepLocal_6 = last_1_var_1_1; [L95] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=0, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L96] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L97] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L100] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L105] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L108] COND FALSE !(var_1_5 >= -2) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L111] unsigned char stepLocal_4 = var_1_6; [L112] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=10, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L113] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=10, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L114] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L115] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L122] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=10, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L123] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L126] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=10, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L127] COND TRUE \read(var_1_19) [L128] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=10, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L134] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L135] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=10, stepLocal_1=201, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L136] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L143] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=10, stepLocal_1=201, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=0] [L209] RET step() [L210] CALL, EXPR property() [L200-L201] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.2s, OverallIterations: 10, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 1794 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1751 mSDsluCounter, 4450 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3264 mSDsCounter, 933 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2523 IncrementalHoareTripleChecker+Invalid, 3472 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 933 mSolverCounterUnsat, 1186 mSDtfsCounter, 2523 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2047 GetRequests, 1879 SyntacticMatches, 4 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3636 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=875occurred in iteration=9, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 846 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 2819 NumberOfCodeBlocks, 2819 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2428 ConstructedInterpolants, 2 QuantifiedInterpolants, 11938 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1778 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 20476/21112 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-10-14 10:31:32,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.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 f02b4d764a6f2b9378677160d85f84fe71fe9bb12a30ec7a53966c7051db5504 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:31:34,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:31:34,964 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 10:31:34,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:31:34,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:31:35,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:31:35,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:31:35,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:31:35,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:31:35,003 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:31:35,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:31:35,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:31:35,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:31:35,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:31:35,007 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:31:35,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:31:35,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:31:35,007 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:31:35,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:31:35,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:31:35,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:31:35,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:31:35,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:31:35,012 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 10:31:35,013 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 10:31:35,013 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:31:35,013 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 10:31:35,013 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:31:35,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:31:35,014 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:31:35,014 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:31:35,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:31:35,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:31:35,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:31:35,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:31:35,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:31:35,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:31:35,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:31:35,027 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 10:31:35,027 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 10:31:35,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:31:35,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:31:35,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:31:35,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:31:35,030 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 10:31:35,030 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 -> f02b4d764a6f2b9378677160d85f84fe71fe9bb12a30ec7a53966c7051db5504 [2024-10-14 10:31:35,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:31:35,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:31:35,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:31:35,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:31:35,402 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:31:35,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-10-14 10:31:37,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:31:37,284 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:31:37,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-10-14 10:31:37,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0df85ffe/89153cf40ff14642a0d30a109608208f/FLAG72cc52fc8 [2024-10-14 10:31:37,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0df85ffe/89153cf40ff14642a0d30a109608208f [2024-10-14 10:31:37,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:31:37,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:31:37,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:31:37,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:31:37,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:31:37,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:31:37" (1/1) ... [2024-10-14 10:31:37,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@baeec82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:37, skipping insertion in model container [2024-10-14 10:31:37,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:31:37" (1/1) ... [2024-10-14 10:31:37,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:31:37,533 WARN L248 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-ps-co_file-42.i[919,932] [2024-10-14 10:31:37,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:31:37,671 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:31:37,684 WARN L248 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-ps-co_file-42.i[919,932] [2024-10-14 10:31:37,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:31:37,775 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:31:37,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:37 WrapperNode [2024-10-14 10:31:37,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:31:37,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:31:37,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:31:37,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:31:37,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:37" (1/1) ... [2024-10-14 10:31:37,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:37" (1/1) ... [2024-10-14 10:31:37,847 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-10-14 10:31:37,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:31:37,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:31:37,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:31:37,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:31:37,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:37" (1/1) ... [2024-10-14 10:31:37,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:37" (1/1) ... [2024-10-14 10:31:37,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:37" (1/1) ... [2024-10-14 10:31:37,908 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-10-14 10:31:37,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:37" (1/1) ... [2024-10-14 10:31:37,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:37" (1/1) ... [2024-10-14 10:31:37,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:37" (1/1) ... [2024-10-14 10:31:37,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:37" (1/1) ... [2024-10-14 10:31:37,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:37" (1/1) ... [2024-10-14 10:31:37,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:37" (1/1) ... [2024-10-14 10:31:37,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:31:37,955 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:31:37,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:31:37,956 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:31:37,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:37" (1/1) ... [2024-10-14 10:31:37,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:31:37,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:31:37,992 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-10-14 10:31:37,995 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-10-14 10:31:38,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:31:38,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 10:31:38,029 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:31:38,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:31:38,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:31:38,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:31:38,123 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:31:38,126 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:31:38,805 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-14 10:31:38,806 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:31:38,864 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:31:38,864 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:31:38,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:31:38 BoogieIcfgContainer [2024-10-14 10:31:38,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:31:38,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:31:38,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:31:38,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:31:38,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:31:37" (1/3) ... [2024-10-14 10:31:38,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9615794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:31:38, skipping insertion in model container [2024-10-14 10:31:38,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:37" (2/3) ... [2024-10-14 10:31:38,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9615794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:31:38, skipping insertion in model container [2024-10-14 10:31:38,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:31:38" (3/3) ... [2024-10-14 10:31:38,876 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-10-14 10:31:38,892 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:31:38,892 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:31:38,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:31:38,974 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4eab0001, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:31:38,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:31:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-14 10:31:38,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-14 10:31:38,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:39,001 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:31:39,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:39,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:39,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1696566966, now seen corresponding path program 1 times [2024-10-14 10:31:39,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:31:39,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166340843] [2024-10-14 10:31:39,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:39,025 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-10-14 10:31:39,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:31:39,029 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-10-14 10:31:39,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 (2)] Waiting until timeout for monitored process [2024-10-14 10:31:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:39,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 10:31:39,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-10-14 10:31:39,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:31:39,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:31:39,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166340843] [2024-10-14 10:31:39,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166340843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:39,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:39,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:31:39,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297386540] [2024-10-14 10:31:39,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:39,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:31:39,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:31:39,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:31:39,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:31:39,491 INFO L87 Difference]: Start difference. First operand has 84 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-14 10:31:39,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:39,595 INFO L93 Difference]: Finished difference Result 165 states and 299 transitions. [2024-10-14 10:31:39,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:31:39,601 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2024-10-14 10:31:39,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:39,607 INFO L225 Difference]: With dead ends: 165 [2024-10-14 10:31:39,608 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 10:31:39,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 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-10-14 10:31:39,615 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:39,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:31:39,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 10:31:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-14 10:31:39,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-14 10:31:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2024-10-14 10:31:39,657 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 129 transitions. Word has length 187 [2024-10-14 10:31:39,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:39,657 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 129 transitions. [2024-10-14 10:31:39,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-14 10:31:39,658 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 129 transitions. [2024-10-14 10:31:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-14 10:31:39,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:39,661 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:31:39,672 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-10-14 10:31:39,862 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-10-14 10:31:39,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:39,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:39,863 INFO L85 PathProgramCache]: Analyzing trace with hash 742667134, now seen corresponding path program 1 times [2024-10-14 10:31:39,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:31:39,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782454778] [2024-10-14 10:31:39,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:39,865 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-10-14 10:31:39,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:31:39,868 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-10-14 10:31:39,869 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-10-14 10:31:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:40,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 10:31:40,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 820 proven. 48 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2024-10-14 10:31:40,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:31:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 36 proven. 48 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-14 10:31:40,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:31:40,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782454778] [2024-10-14 10:31:40,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782454778] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:31:40,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 10:31:40,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-14 10:31:40,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364167539] [2024-10-14 10:31:40,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 10:31:40,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 10:31:40,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:31:40,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 10:31:40,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:31:40,826 INFO L87 Difference]: Start difference. First operand 82 states and 129 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-14 10:31:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:41,329 INFO L93 Difference]: Finished difference Result 169 states and 262 transitions. [2024-10-14 10:31:41,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 10:31:41,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 187 [2024-10-14 10:31:41,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:41,340 INFO L225 Difference]: With dead ends: 169 [2024-10-14 10:31:41,340 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 10:31:41,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 366 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-14 10:31:41,346 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 63 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:41,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 214 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 10:31:41,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 10:31:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-10-14 10:31:41,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-14 10:31:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 130 transitions. [2024-10-14 10:31:41,371 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 130 transitions. Word has length 187 [2024-10-14 10:31:41,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:41,372 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 130 transitions. [2024-10-14 10:31:41,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-14 10:31:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 130 transitions. [2024-10-14 10:31:41,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-14 10:31:41,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:41,382 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:31:41,394 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-10-14 10:31:41,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:31:41,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:41,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:41,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1863356420, now seen corresponding path program 1 times [2024-10-14 10:31:41,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:31:41,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060205549] [2024-10-14 10:31:41,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:41,586 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-10-14 10:31:41,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:31:41,589 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:31:41,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 10:31:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:41,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 10:31:41,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 10:31:42,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:31:42,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:31:42,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060205549] [2024-10-14 10:31:42,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060205549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:42,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:42,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:31:42,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572838716] [2024-10-14 10:31:42,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:42,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:31:42,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:31:42,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:31:42,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:31:42,243 INFO L87 Difference]: Start difference. First operand 86 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:31:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:42,616 INFO L93 Difference]: Finished difference Result 257 states and 389 transitions. [2024-10-14 10:31:42,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:31:42,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-14 10:31:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:42,624 INFO L225 Difference]: With dead ends: 257 [2024-10-14 10:31:42,624 INFO L226 Difference]: Without dead ends: 172 [2024-10-14 10:31:42,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:31:42,626 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 94 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:42,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 363 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 10:31:42,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-14 10:31:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 152. [2024-10-14 10:31:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 89 states have internal predecessors, (112), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-14 10:31:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 228 transitions. [2024-10-14 10:31:42,654 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 228 transitions. Word has length 187 [2024-10-14 10:31:42,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:42,655 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 228 transitions. [2024-10-14 10:31:42,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:31:42,656 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 228 transitions. [2024-10-14 10:31:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-14 10:31:42,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:42,658 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:31:42,671 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 (4)] Forceful destruction successful, exit code 0 [2024-10-14 10:31:42,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-10-14 10:31:42,859 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:42,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:42,860 INFO L85 PathProgramCache]: Analyzing trace with hash -263142898, now seen corresponding path program 1 times [2024-10-14 10:31:42,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:31:42,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534319400] [2024-10-14 10:31:42,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:42,861 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-10-14 10:31:42,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:31:42,864 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-10-14 10:31:42,866 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-10-14 10:31:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:43,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 10:31:43,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 10:31:44,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:31:44,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:31:44,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534319400] [2024-10-14 10:31:44,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534319400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:44,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:44,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:31:44,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035197494] [2024-10-14 10:31:44,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:44,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:31:44,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:31:44,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:31:44,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:31:44,234 INFO L87 Difference]: Start difference. First operand 152 states and 228 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:31:45,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:45,244 INFO L93 Difference]: Finished difference Result 365 states and 552 transitions. [2024-10-14 10:31:45,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 10:31:45,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-14 10:31:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:45,255 INFO L225 Difference]: With dead ends: 365 [2024-10-14 10:31:45,255 INFO L226 Difference]: Without dead ends: 280 [2024-10-14 10:31:45,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 10:31:45,257 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 151 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:45,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 441 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 10:31:45,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-14 10:31:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 235. [2024-10-14 10:31:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 141 states have internal predecessors, (181), 87 states have call successors, (87), 6 states have call predecessors, (87), 6 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-14 10:31:45,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 355 transitions. [2024-10-14 10:31:45,314 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 355 transitions. Word has length 188 [2024-10-14 10:31:45,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:45,315 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 355 transitions. [2024-10-14 10:31:45,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:31:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 355 transitions. [2024-10-14 10:31:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-14 10:31:45,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:45,318 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:31:45,334 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 (5)] Forceful destruction successful, exit code 0 [2024-10-14 10:31:45,519 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 [2024-10-14 10:31:45,519 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:45,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:45,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1274260148, now seen corresponding path program 1 times [2024-10-14 10:31:45,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:31:45,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010420183] [2024-10-14 10:31:45,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:45,521 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-10-14 10:31:45,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:31:45,523 INFO L229 MonitoredProcess]: Starting monitored process 6 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-10-14 10:31:45,525 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 (6)] Waiting until timeout for monitored process [2024-10-14 10:31:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:45,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 10:31:45,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 10:31:45,901 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:31:45,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:31:45,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010420183] [2024-10-14 10:31:45,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010420183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:45,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:45,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:31:45,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898948376] [2024-10-14 10:31:45,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:45,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:31:45,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:31:45,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:31:45,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:31:45,904 INFO L87 Difference]: Start difference. First operand 235 states and 355 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:31:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:46,021 INFO L93 Difference]: Finished difference Result 403 states and 611 transitions. [2024-10-14 10:31:46,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:31:46,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-14 10:31:46,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:46,033 INFO L225 Difference]: With dead ends: 403 [2024-10-14 10:31:46,035 INFO L226 Difference]: Without dead ends: 235 [2024-10-14 10:31:46,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:31:46,037 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:46,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:31:46,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-14 10:31:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2024-10-14 10:31:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 141 states have (on average 1.2695035460992907) internal successors, (179), 141 states have internal predecessors, (179), 87 states have call successors, (87), 6 states have call predecessors, (87), 6 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-14 10:31:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 353 transitions. [2024-10-14 10:31:46,068 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 353 transitions. Word has length 188 [2024-10-14 10:31:46,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:46,068 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 353 transitions. [2024-10-14 10:31:46,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:31:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 353 transitions. [2024-10-14 10:31:46,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-14 10:31:46,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:46,071 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:31:46,085 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 (6)] Forceful destruction successful, exit code 0 [2024-10-14 10:31:46,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-10-14 10:31:46,276 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:46,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2083606774, now seen corresponding path program 1 times [2024-10-14 10:31:46,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:31:46,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825293616] [2024-10-14 10:31:46,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:46,277 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-10-14 10:31:46,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:31:46,279 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-10-14 10:31:46,280 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-10-14 10:31:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:46,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 10:31:46,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:47,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 863 proven. 111 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-10-14 10:31:47,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:31:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 114 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-10-14 10:31:47,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:31:47,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825293616] [2024-10-14 10:31:47,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825293616] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:31:47,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 10:31:47,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-10-14 10:31:47,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301956304] [2024-10-14 10:31:47,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 10:31:47,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 10:31:47,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:31:47,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 10:31:47,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-14 10:31:47,646 INFO L87 Difference]: Start difference. First operand 235 states and 353 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-10-14 10:31:48,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:48,864 INFO L93 Difference]: Finished difference Result 470 states and 670 transitions. [2024-10-14 10:31:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-14 10:31:48,865 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 188 [2024-10-14 10:31:48,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:48,869 INFO L225 Difference]: With dead ends: 470 [2024-10-14 10:31:48,869 INFO L226 Difference]: Without dead ends: 385 [2024-10-14 10:31:48,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 10:31:48,871 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 177 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:48,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 555 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 10:31:48,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-14 10:31:48,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 359. [2024-10-14 10:31:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 226 states have (on average 1.252212389380531) internal successors, (283), 226 states have internal predecessors, (283), 116 states have call successors, (116), 16 states have call predecessors, (116), 16 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-10-14 10:31:48,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 515 transitions. [2024-10-14 10:31:48,923 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 515 transitions. Word has length 188 [2024-10-14 10:31:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:48,924 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 515 transitions. [2024-10-14 10:31:48,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-10-14 10:31:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 515 transitions. [2024-10-14 10:31:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-14 10:31:48,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:48,926 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:31:48,940 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 (7)] Ended with exit code 0 [2024-10-14 10:31:49,130 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 [2024-10-14 10:31:49,131 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:49,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:49,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1624554508, now seen corresponding path program 1 times [2024-10-14 10:31:49,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:31:49,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503953756] [2024-10-14 10:31:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:49,132 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-10-14 10:31:49,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:31:49,133 INFO L229 MonitoredProcess]: Starting monitored process 8 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-10-14 10:31:49,135 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 (8)] Waiting until timeout for monitored process [2024-10-14 10:31:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:49,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 10:31:49,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:50,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-10-14 10:31:50,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:31:51,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:31:51,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503953756] [2024-10-14 10:31:51,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503953756] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:31:51,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [386256770] [2024-10-14 10:31:51,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:51,035 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 10:31:51,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 10:31:51,036 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 10:31:51,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-14 10:31:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:51,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-10-14 10:31:51,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:57,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 10:31:57,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:31:57,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [386256770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:57,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 10:31:57,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-10-14 10:31:57,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426544735] [2024-10-14 10:31:57,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:57,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 10:31:57,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:31:57,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 10:31:57,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-10-14 10:31:57,629 INFO L87 Difference]: Start difference. First operand 359 states and 515 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:32:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:32:00,212 INFO L93 Difference]: Finished difference Result 659 states and 945 transitions. [2024-10-14 10:32:00,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 10:32:00,213 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-14 10:32:00,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:32:00,216 INFO L225 Difference]: With dead ends: 659 [2024-10-14 10:32:00,216 INFO L226 Difference]: Without dead ends: 371 [2024-10-14 10:32:00,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 386 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-10-14 10:32:00,218 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 98 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:32:00,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 440 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 10:32:00,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-14 10:32:00,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 358. [2024-10-14 10:32:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 225 states have (on average 1.231111111111111) internal successors, (277), 225 states have internal predecessors, (277), 116 states have call successors, (116), 16 states have call predecessors, (116), 16 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-10-14 10:32:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 509 transitions. [2024-10-14 10:32:00,258 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 509 transitions. Word has length 188 [2024-10-14 10:32:00,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:32:00,259 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 509 transitions. [2024-10-14 10:32:00,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:32:00,259 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 509 transitions. [2024-10-14 10:32:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-14 10:32:00,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:32:00,261 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:32:00,276 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 (8)] Ended with exit code 0 [2024-10-14 10:32:00,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-10-14 10:32:00,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 10:32:00,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:32:00,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:32:00,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1366389070, now seen corresponding path program 1 times [2024-10-14 10:32:00,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:32:00,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337296221] [2024-10-14 10:32:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:32:00,665 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-10-14 10:32:00,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:32:00,671 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10-14 10:32:00,675 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 (10)] Waiting until timeout for monitored process [2024-10-14 10:32:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:32:00,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 10:32:00,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:32:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-10-14 10:32:01,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:32:02,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:32:02,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337296221] [2024-10-14 10:32:02,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337296221] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:32:02,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [495614799] [2024-10-14 10:32:02,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:32:02,189 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 10:32:02,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 10:32:02,190 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 10:32:02,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-10-14 10:32:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:32:02,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-10-14 10:32:02,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:32:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 10:32:07,734 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:32:07,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [495614799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:32:07,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 10:32:07,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 14 [2024-10-14 10:32:07,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040980191] [2024-10-14 10:32:07,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:32:07,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 10:32:07,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:32:07,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 10:32:07,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-10-14 10:32:07,737 INFO L87 Difference]: Start difference. First operand 358 states and 509 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:32:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:32:10,421 INFO L93 Difference]: Finished difference Result 574 states and 814 transitions. [2024-10-14 10:32:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 10:32:10,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-14 10:32:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:32:10,425 INFO L225 Difference]: With dead ends: 574 [2024-10-14 10:32:10,425 INFO L226 Difference]: Without dead ends: 391 [2024-10-14 10:32:10,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 385 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-10-14 10:32:10,427 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 112 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 10:32:10,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 478 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 10:32:10,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-14 10:32:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 358. [2024-10-14 10:32:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 225 states have (on average 1.231111111111111) internal successors, (277), 225 states have internal predecessors, (277), 116 states have call successors, (116), 16 states have call predecessors, (116), 16 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-10-14 10:32:10,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 509 transitions. [2024-10-14 10:32:10,463 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 509 transitions. Word has length 188 [2024-10-14 10:32:10,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:32:10,463 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 509 transitions. [2024-10-14 10:32:10,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:32:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 509 transitions. [2024-10-14 10:32:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-14 10:32:10,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:32:10,466 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:32:10,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-10-14 10:32:10,678 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 (10)] Forceful destruction successful, exit code 0 [2024-10-14 10:32:10,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt,10 /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-10-14 10:32:10,867 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:32:10,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:32:10,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1537601995, now seen corresponding path program 1 times [2024-10-14 10:32:10,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:32:10,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519377803] [2024-10-14 10:32:10,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:32:10,868 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-10-14 10:32:10,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:32:10,869 INFO L229 MonitoredProcess]: Starting monitored process 12 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-10-14 10:32:10,870 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 (12)] Waiting until timeout for monitored process [2024-10-14 10:32:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:32:11,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 10:32:11,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:32:11,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-10-14 10:32:11,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:32:12,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:32:12,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519377803] [2024-10-14 10:32:12,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519377803] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:32:12,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [2089316864] [2024-10-14 10:32:12,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:32:12,341 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 10:32:12,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 10:32:12,342 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 10:32:12,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-10-14 10:32:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:32:12,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-10-14 10:32:12,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:32:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 10:32:19,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:32:19,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [2089316864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:32:19,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 10:32:19,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-10-14 10:32:19,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761100227] [2024-10-14 10:32:19,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:32:19,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 10:32:19,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:32:19,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 10:32:19,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-10-14 10:32:19,416 INFO L87 Difference]: Start difference. First operand 358 states and 509 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:32:22,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:32:22,222 INFO L93 Difference]: Finished difference Result 585 states and 826 transitions. [2024-10-14 10:32:22,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 10:32:22,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 189 [2024-10-14 10:32:22,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:32:22,226 INFO L225 Difference]: With dead ends: 585 [2024-10-14 10:32:22,226 INFO L226 Difference]: Without dead ends: 401 [2024-10-14 10:32:22,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 389 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-10-14 10:32:22,229 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 137 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:32:22,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 456 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 10:32:22,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-14 10:32:22,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 361. [2024-10-14 10:32:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 228 states have (on average 1.2324561403508771) internal successors, (281), 228 states have internal predecessors, (281), 116 states have call successors, (116), 16 states have call predecessors, (116), 16 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-10-14 10:32:22,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 513 transitions. [2024-10-14 10:32:22,270 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 513 transitions. Word has length 189 [2024-10-14 10:32:22,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:32:22,270 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 513 transitions. [2024-10-14 10:32:22,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 10:32:22,271 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 513 transitions. [2024-10-14 10:32:22,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-14 10:32:22,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:32:22,272 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:32:22,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-10-14 10:32:22,484 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 (12)] Forceful destruction successful, exit code 0 [2024-10-14 10:32:22,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt,12 /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-10-14 10:32:22,673 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:32:22,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:32:22,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2124408009, now seen corresponding path program 1 times [2024-10-14 10:32:22,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:32:22,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018584735] [2024-10-14 10:32:22,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:32:22,675 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-10-14 10:32:22,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:32:22,677 INFO L229 MonitoredProcess]: Starting monitored process 14 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-10-14 10:32:22,678 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 (14)] Waiting until timeout for monitored process [2024-10-14 10:32:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:32:22,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 10:32:22,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:32:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-10-14 10:32:23,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:32:24,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:32:24,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018584735] [2024-10-14 10:32:24,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018584735] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:32:24,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1009656090] [2024-10-14 10:32:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:32:24,328 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 10:32:24,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 10:32:24,330 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 10:32:24,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-10-14 10:32:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:32:24,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 133 conjuncts are in the unsatisfiable core [2024-10-14 10:32:24,599 INFO L278 TraceCheckSpWp]: Computing forward predicates...