./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.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 4679e818c2a87d1f6ceadee5a436eeb96f16b48c4384e7075e733b0d1dd8bd5a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:34:36,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:34:36,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:34:36,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:34:36,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:34:36,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:34:36,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:34:36,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:34:36,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:34:36,192 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:34:36,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:34:36,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:34:36,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:34:36,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:34:36,194 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:34:36,195 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:34:36,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:34:36,196 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:34:36,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:34:36,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:34:36,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:34:36,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:34:36,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:34:36,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:34:36,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:34:36,202 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:34:36,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:34:36,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:34:36,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:34:36,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:34:36,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:34:36,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:34:36,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:34:36,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:34:36,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:34:36,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:34:36,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:34:36,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:34:36,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:34:36,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:34:36,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:34:36,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:34:36,207 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 -> 4679e818c2a87d1f6ceadee5a436eeb96f16b48c4384e7075e733b0d1dd8bd5a [2024-11-08 21:34:36,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:34:36,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:34:36,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:34:36,463 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:34:36,463 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:34:36,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i [2024-11-08 21:34:37,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:34:38,024 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:34:38,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i [2024-11-08 21:34:38,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01d614258/4e743a88792846e386ce717880c549b2/FLAG1eece33a3 [2024-11-08 21:34:38,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01d614258/4e743a88792846e386ce717880c549b2 [2024-11-08 21:34:38,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:34:38,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:34:38,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:34:38,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:34:38,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:34:38,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:34:38" (1/1) ... [2024-11-08 21:34:38,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@140d9c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:38, skipping insertion in model container [2024-11-08 21:34:38,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:34:38" (1/1) ... [2024-11-08 21:34:38,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:34:38,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i[919,932] [2024-11-08 21:34:38,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:34:38,296 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:34:38,306 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i[919,932] [2024-11-08 21:34:38,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:34:38,364 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:34:38,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:38 WrapperNode [2024-11-08 21:34:38,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:34:38,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:34:38,367 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:34:38,367 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:34:38,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:38" (1/1) ... [2024-11-08 21:34:38,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:38" (1/1) ... [2024-11-08 21:34:38,424 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 282 [2024-11-08 21:34:38,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:34:38,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:34:38,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:34:38,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:34:38,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:38" (1/1) ... [2024-11-08 21:34:38,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:38" (1/1) ... [2024-11-08 21:34:38,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:38" (1/1) ... [2024-11-08 21:34:38,474 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:34:38,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:38" (1/1) ... [2024-11-08 21:34:38,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:38" (1/1) ... [2024-11-08 21:34:38,483 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:38" (1/1) ... [2024-11-08 21:34:38,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:38" (1/1) ... [2024-11-08 21:34:38,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:38" (1/1) ... [2024-11-08 21:34:38,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:38" (1/1) ... [2024-11-08 21:34:38,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:34:38,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:34:38,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:34:38,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:34:38,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:38" (1/1) ... [2024-11-08 21:34:38,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:34:38,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:34:38,550 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:34:38,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:34:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:34:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:34:38,587 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:34:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:34:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:34:38,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:34:38,674 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:34:38,676 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:34:39,025 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 21:34:39,026 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:34:39,037 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:34:39,037 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:34:39,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:34:39 BoogieIcfgContainer [2024-11-08 21:34:39,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:34:39,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:34:39,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:34:39,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:34:39,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:34:38" (1/3) ... [2024-11-08 21:34:39,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16308d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:34:39, skipping insertion in model container [2024-11-08 21:34:39,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:38" (2/3) ... [2024-11-08 21:34:39,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16308d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:34:39, skipping insertion in model container [2024-11-08 21:34:39,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:34:39" (3/3) ... [2024-11-08 21:34:39,045 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i [2024-11-08 21:34:39,058 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:34:39,058 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:34:39,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:34:39,125 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;@e3827a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:34:39,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:34:39,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 84 states have internal predecessors, (124), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:34:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 21:34:39,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:34:39,148 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:34:39,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:34:39,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:34:39,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1325621757, now seen corresponding path program 1 times [2024-11-08 21:34:39,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:34:39,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732421523] [2024-11-08 21:34:39,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:34:39,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:34:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:34:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:34:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:34:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:34:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:34:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:34:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:34:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:34:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:34:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:34:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:34:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:34:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:34:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:34:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:34:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:34:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:34:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:34:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:34:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:34:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:34:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:34:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:34:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:34:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:34:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:34:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:34:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:34:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:34:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:34:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:34:39,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:34:39,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732421523] [2024-11-08 21:34:39,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732421523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:34:39,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:34:39,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:34:39,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307818051] [2024-11-08 21:34:39,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:34:39,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:34:39,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:34:39,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:34:39,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:34:39,656 INFO L87 Difference]: Start difference. First operand has 116 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 84 states have internal predecessors, (124), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:34:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:34:39,682 INFO L93 Difference]: Finished difference Result 223 states and 390 transitions. [2024-11-08 21:34:39,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:34:39,684 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 197 [2024-11-08 21:34:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:34:39,690 INFO L225 Difference]: With dead ends: 223 [2024-11-08 21:34:39,690 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 21:34:39,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:34:39,722 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:34:39,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:34:39,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 21:34:39,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-08 21:34:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:34:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 171 transitions. [2024-11-08 21:34:39,813 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 171 transitions. Word has length 197 [2024-11-08 21:34:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:34:39,813 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 171 transitions. [2024-11-08 21:34:39,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:34:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 171 transitions. [2024-11-08 21:34:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 21:34:39,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:34:39,820 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:34:39,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:34:39,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:34:39,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:34:39,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1483921595, now seen corresponding path program 1 times [2024-11-08 21:34:39,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:34:39,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471893737] [2024-11-08 21:34:39,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:34:39,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:34:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:34:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:34:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:34:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:34:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:34:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:34:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:34:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:34:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:34:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:34:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:34:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:34:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:34:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:34:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:34:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:34:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:34:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:34:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:34:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:34:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:34:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:34:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:34:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:34:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:34:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:34:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:34:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:34:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:34:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:34:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:34:40,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:34:40,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471893737] [2024-11-08 21:34:40,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471893737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:34:40,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:34:40,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:34:40,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311162197] [2024-11-08 21:34:40,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:34:40,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:34:40,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:34:40,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:34:40,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:34:40,118 INFO L87 Difference]: Start difference. First operand 110 states and 171 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:34:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:34:40,218 INFO L93 Difference]: Finished difference Result 324 states and 507 transitions. [2024-11-08 21:34:40,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:34:40,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 197 [2024-11-08 21:34:40,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:34:40,222 INFO L225 Difference]: With dead ends: 324 [2024-11-08 21:34:40,223 INFO L226 Difference]: Without dead ends: 217 [2024-11-08 21:34:40,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:34:40,226 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 155 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:34:40,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 456 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:34:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-08 21:34:40,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 147. [2024-11-08 21:34:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 115 states have (on average 1.4782608695652173) internal successors, (170), 115 states have internal predecessors, (170), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:34:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 230 transitions. [2024-11-08 21:34:40,251 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 230 transitions. Word has length 197 [2024-11-08 21:34:40,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:34:40,257 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 230 transitions. [2024-11-08 21:34:40,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:34:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 230 transitions. [2024-11-08 21:34:40,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-08 21:34:40,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:34:40,264 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:34:40,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:34:40,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:34:40,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:34:40,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1174692652, now seen corresponding path program 1 times [2024-11-08 21:34:40,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:34:40,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677242742] [2024-11-08 21:34:40,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:34:40,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:34:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:34:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:34:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:34:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:34:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:34:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:34:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:34:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:34:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:34:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:34:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:34:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:34:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:34:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:34:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:34:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:34:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:34:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:34:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:34:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:34:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:34:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:34:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:34:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:34:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:34:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:34:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:34:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:34:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:34:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:34:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:34:40,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:34:40,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677242742] [2024-11-08 21:34:40,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677242742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:34:40,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:34:40,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:34:40,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384779265] [2024-11-08 21:34:40,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:34:40,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:34:40,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:34:40,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:34:40,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:34:40,518 INFO L87 Difference]: Start difference. First operand 147 states and 230 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:34:40,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:34:40,583 INFO L93 Difference]: Finished difference Result 252 states and 390 transitions. [2024-11-08 21:34:40,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:34:40,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2024-11-08 21:34:40,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:34:40,590 INFO L225 Difference]: With dead ends: 252 [2024-11-08 21:34:40,590 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 21:34:40,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:34:40,592 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:34:40,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:34:40,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 21:34:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-08 21:34:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 76 states have internal predecessors, (102), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:34:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 162 transitions. [2024-11-08 21:34:40,606 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 162 transitions. Word has length 198 [2024-11-08 21:34:40,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:34:40,608 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 162 transitions. [2024-11-08 21:34:40,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:34:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 162 transitions. [2024-11-08 21:34:40,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 21:34:40,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:34:40,611 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:34:40,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:34:40,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:34:40,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:34:40,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1966857430, now seen corresponding path program 1 times [2024-11-08 21:34:40,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:34:40,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517322884] [2024-11-08 21:34:40,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:34:40,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:34:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:34:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:34:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:34:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:34:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:34:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:34:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:34:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:34:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:34:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:34:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:34:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:34:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:34:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:34:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:34:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:34:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:34:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:34:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:34:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:34:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:34:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:34:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:34:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:34:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:34:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:34:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:34:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:34:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:34:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:34:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:34:40,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:34:40,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517322884] [2024-11-08 21:34:40,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517322884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:34:40,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:34:40,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:34:40,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743560317] [2024-11-08 21:34:40,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:34:40,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:34:40,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:34:40,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:34:40,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:34:40,871 INFO L87 Difference]: Start difference. First operand 108 states and 162 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:34:41,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:34:41,193 INFO L93 Difference]: Finished difference Result 327 states and 486 transitions. [2024-11-08 21:34:41,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 21:34:41,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 199 [2024-11-08 21:34:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:34:41,197 INFO L225 Difference]: With dead ends: 327 [2024-11-08 21:34:41,197 INFO L226 Difference]: Without dead ends: 222 [2024-11-08 21:34:41,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 21:34:41,201 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 304 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:34:41,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 769 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:34:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-08 21:34:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2024-11-08 21:34:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 150 states have (on average 1.32) internal successors, (198), 152 states have internal predecessors, (198), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 21:34:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 322 transitions. [2024-11-08 21:34:41,226 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 322 transitions. Word has length 199 [2024-11-08 21:34:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:34:41,227 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 322 transitions. [2024-11-08 21:34:41,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:34:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 322 transitions. [2024-11-08 21:34:41,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 21:34:41,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:34:41,229 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:34:41,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:34:41,229 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:34:41,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:34:41,230 INFO L85 PathProgramCache]: Analyzing trace with hash 27287276, now seen corresponding path program 1 times [2024-11-08 21:34:41,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:34:41,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630142933] [2024-11-08 21:34:41,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:34:41,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:34:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:34:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:34:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:34:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:34:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:34:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:34:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:34:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:34:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:34:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:34:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:34:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:34:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:34:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:34:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:34:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:34:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:34:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:34:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:34:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:34:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:34:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:34:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:34:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:34:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:34:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:34:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:34:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:34:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:34:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:34:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:34:41,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:34:41,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630142933] [2024-11-08 21:34:41,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630142933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:34:41,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:34:41,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:34:41,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049204217] [2024-11-08 21:34:41,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:34:41,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:34:41,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:34:41,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:34:41,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:34:41,452 INFO L87 Difference]: Start difference. First operand 217 states and 322 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:34:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:34:41,621 INFO L93 Difference]: Finished difference Result 727 states and 1079 transitions. [2024-11-08 21:34:41,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:34:41,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 199 [2024-11-08 21:34:41,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:34:41,626 INFO L225 Difference]: With dead ends: 727 [2024-11-08 21:34:41,626 INFO L226 Difference]: Without dead ends: 517 [2024-11-08 21:34:41,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:34:41,628 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 342 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:34:41,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 469 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:34:41,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-08 21:34:41,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 248. [2024-11-08 21:34:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 181 states have (on average 1.3701657458563536) internal successors, (248), 183 states have internal predecessors, (248), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 21:34:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 372 transitions. [2024-11-08 21:34:41,658 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 372 transitions. Word has length 199 [2024-11-08 21:34:41,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:34:41,659 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 372 transitions. [2024-11-08 21:34:41,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:34:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 372 transitions. [2024-11-08 21:34:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 21:34:41,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:34:41,660 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:34:41,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 21:34:41,661 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:34:41,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:34:41,661 INFO L85 PathProgramCache]: Analyzing trace with hash -939728854, now seen corresponding path program 1 times [2024-11-08 21:34:41,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:34:41,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672739323] [2024-11-08 21:34:41,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:34:41,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:34:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:34:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:34:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:34:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:34:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:34:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:34:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:34:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:34:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:34:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:34:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:34:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:34:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:34:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:34:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:34:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:34:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:34:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:34:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:34:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:34:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:34:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:34:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:34:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:34:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:34:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:34:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:34:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:34:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:34:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:34:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:34:42,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:34:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672739323] [2024-11-08 21:34:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672739323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:34:42,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:34:42,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:34:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275524212] [2024-11-08 21:34:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:34:42,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:34:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:34:42,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:34:42,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:34:42,341 INFO L87 Difference]: Start difference. First operand 248 states and 372 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:34:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:34:42,695 INFO L93 Difference]: Finished difference Result 653 states and 983 transitions. [2024-11-08 21:34:42,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 21:34:42,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 199 [2024-11-08 21:34:42,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:34:42,698 INFO L225 Difference]: With dead ends: 653 [2024-11-08 21:34:42,698 INFO L226 Difference]: Without dead ends: 412 [2024-11-08 21:34:42,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:34:42,700 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 310 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:34:42,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 859 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:34:42,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-08 21:34:42,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 243. [2024-11-08 21:34:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 179 states have (on average 1.3966480446927374) internal successors, (250), 180 states have internal predecessors, (250), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:34:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 370 transitions. [2024-11-08 21:34:42,731 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 370 transitions. Word has length 199 [2024-11-08 21:34:42,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:34:42,732 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 370 transitions. [2024-11-08 21:34:42,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:34:42,732 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 370 transitions. [2024-11-08 21:34:42,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 21:34:42,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:34:42,734 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:34:42,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 21:34:42,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:34:42,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:34:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash 500947806, now seen corresponding path program 1 times [2024-11-08 21:34:42,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:34:42,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302876231] [2024-11-08 21:34:42,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:34:42,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:34:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:34:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:34:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:34:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:34:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:34:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:34:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:34:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:34:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:34:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:34:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:34:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:34:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:34:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:34:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:34:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:34:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:34:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:34:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:34:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:34:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:34:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:34:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:34:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:34:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:34:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:34:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:34:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:34:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:34:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:34:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:34:43,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:34:43,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302876231] [2024-11-08 21:34:43,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302876231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:34:43,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:34:43,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 21:34:43,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827649405] [2024-11-08 21:34:43,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:34:43,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 21:34:43,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:34:43,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 21:34:43,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 21:34:43,577 INFO L87 Difference]: Start difference. First operand 243 states and 370 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-08 21:34:44,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:34:44,370 INFO L93 Difference]: Finished difference Result 548 states and 819 transitions. [2024-11-08 21:34:44,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 21:34:44,370 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 200 [2024-11-08 21:34:44,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:34:44,373 INFO L225 Difference]: With dead ends: 548 [2024-11-08 21:34:44,373 INFO L226 Difference]: Without dead ends: 360 [2024-11-08 21:34:44,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-08 21:34:44,375 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 475 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 21:34:44,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 396 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 21:34:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-08 21:34:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 265. [2024-11-08 21:34:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 198 states have (on average 1.3484848484848484) internal successors, (267), 199 states have internal predecessors, (267), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:34:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 387 transitions. [2024-11-08 21:34:44,412 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 387 transitions. Word has length 200 [2024-11-08 21:34:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:34:44,412 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 387 transitions. [2024-11-08 21:34:44,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-08 21:34:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 387 transitions. [2024-11-08 21:34:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 21:34:44,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:34:44,414 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:34:44,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 21:34:44,415 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:34:44,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:34:44,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2054416226, now seen corresponding path program 1 times [2024-11-08 21:34:44,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:34:44,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182811452] [2024-11-08 21:34:44,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:34:44,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:34:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:34:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:34:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:34:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:34:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:34:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:34:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:34:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:34:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:34:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:34:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:34:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:34:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:34:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:34:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:34:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:34:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:34:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:34:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:34:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:34:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:34:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:34:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:34:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:34:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:34:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:34:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:34:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:34:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:34:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:34:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:34:44,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:34:44,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182811452] [2024-11-08 21:34:44,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182811452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:34:44,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:34:44,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 21:34:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119226479] [2024-11-08 21:34:44,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:34:44,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:34:44,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:34:44,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:34:44,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:34:44,997 INFO L87 Difference]: Start difference. First operand 265 states and 387 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:34:45,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:34:45,609 INFO L93 Difference]: Finished difference Result 654 states and 938 transitions. [2024-11-08 21:34:45,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 21:34:45,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2024-11-08 21:34:45,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:34:45,611 INFO L225 Difference]: With dead ends: 654 [2024-11-08 21:34:45,611 INFO L226 Difference]: Without dead ends: 448 [2024-11-08 21:34:45,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-08 21:34:45,613 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 380 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 21:34:45,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1067 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 21:34:45,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-08 21:34:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 228. [2024-11-08 21:34:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 161 states have (on average 1.2981366459627328) internal successors, (209), 162 states have internal predecessors, (209), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:34:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 329 transitions. [2024-11-08 21:34:45,645 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 329 transitions. Word has length 200 [2024-11-08 21:34:45,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:34:45,646 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 329 transitions. [2024-11-08 21:34:45,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:34:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 329 transitions. [2024-11-08 21:34:45,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 21:34:45,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:34:45,648 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:34:45,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 21:34:45,648 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:34:45,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:34:45,649 INFO L85 PathProgramCache]: Analyzing trace with hash 334324810, now seen corresponding path program 1 times [2024-11-08 21:34:45,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:34:45,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790184908] [2024-11-08 21:34:45,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:34:45,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:34:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:34:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:34:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:34:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:34:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:34:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:34:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:34:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:34:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:34:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:34:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:34:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:34:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:34:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:34:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:34:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:34:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:34:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:34:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:34:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:34:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:34:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:34:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:34:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:34:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:34:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:34:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:34:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:34:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:34:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:34:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:46,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:34:46,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:34:46,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790184908] [2024-11-08 21:34:46,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790184908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:34:46,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:34:46,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 21:34:46,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076313735] [2024-11-08 21:34:46,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:34:46,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:34:46,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:34:46,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:34:46,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:34:46,219 INFO L87 Difference]: Start difference. First operand 228 states and 329 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-08 21:34:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:34:46,628 INFO L93 Difference]: Finished difference Result 369 states and 527 transitions. [2024-11-08 21:34:46,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 21:34:46,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 203 [2024-11-08 21:34:46,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:34:46,630 INFO L225 Difference]: With dead ends: 369 [2024-11-08 21:34:46,631 INFO L226 Difference]: Without dead ends: 200 [2024-11-08 21:34:46,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:34:46,632 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 375 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:34:46,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 242 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:34:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-08 21:34:46,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 181. [2024-11-08 21:34:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 114 states have (on average 1.1578947368421053) internal successors, (132), 115 states have internal predecessors, (132), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:34:46,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 252 transitions. [2024-11-08 21:34:46,662 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 252 transitions. Word has length 203 [2024-11-08 21:34:46,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:34:46,662 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 252 transitions. [2024-11-08 21:34:46,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-08 21:34:46,663 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 252 transitions. [2024-11-08 21:34:46,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 21:34:46,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:34:46,665 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:34:46,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 21:34:46,665 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:34:46,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:34:46,666 INFO L85 PathProgramCache]: Analyzing trace with hash 932354336, now seen corresponding path program 1 times [2024-11-08 21:34:46,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:34:46,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288699405] [2024-11-08 21:34:46,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:34:46,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:34:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:34:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:34:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:34:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:34:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:34:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:34:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:34:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:34:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:34:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:34:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:34:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:34:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:34:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:34:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:34:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:34:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:34:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:34:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:34:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:34:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:34:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:34:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:34:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:34:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:34:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:34:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:34:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:34:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:34:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:34:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:34:47,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:34:47,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288699405] [2024-11-08 21:34:47,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288699405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:34:47,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:34:47,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:34:47,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984445352] [2024-11-08 21:34:47,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:34:47,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:34:47,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:34:47,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:34:47,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:34:47,137 INFO L87 Difference]: Start difference. First operand 181 states and 252 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:34:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:34:47,492 INFO L93 Difference]: Finished difference Result 305 states and 419 transitions. [2024-11-08 21:34:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:34:47,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 203 [2024-11-08 21:34:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:34:47,494 INFO L225 Difference]: With dead ends: 305 [2024-11-08 21:34:47,494 INFO L226 Difference]: Without dead ends: 183 [2024-11-08 21:34:47,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:34:47,495 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 248 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:34:47,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 267 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:34:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-08 21:34:47,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2024-11-08 21:34:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 114 states have (on average 1.1403508771929824) internal successors, (130), 115 states have internal predecessors, (130), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:34:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 250 transitions. [2024-11-08 21:34:47,530 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 250 transitions. Word has length 203 [2024-11-08 21:34:47,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:34:47,530 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 250 transitions. [2024-11-08 21:34:47,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:34:47,530 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 250 transitions. [2024-11-08 21:34:47,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 21:34:47,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:34:47,531 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:34:47,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 21:34:47,532 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:34:47,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:34:47,532 INFO L85 PathProgramCache]: Analyzing trace with hash 768179659, now seen corresponding path program 1 times [2024-11-08 21:34:47,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:34:47,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904195185] [2024-11-08 21:34:47,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:34:47,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:34:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:34:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:34:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:34:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:34:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:34:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:34:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:34:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:34:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:34:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:34:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:34:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:34:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:34:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:34:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:34:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:34:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:34:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:34:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:34:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:34:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:34:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:34:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:34:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:34:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:34:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:34:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:34:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:34:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:34:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:34:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 18 proven. 69 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 21:34:47,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:34:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904195185] [2024-11-08 21:34:47,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904195185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:34:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316104125] [2024-11-08 21:34:47,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:34:47,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:34:47,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:34:47,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:34:47,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 21:34:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:47,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 21:34:47,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:34:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 593 proven. 69 refuted. 0 times theorem prover too weak. 1078 trivial. 0 not checked. [2024-11-08 21:34:48,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:34:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 18 proven. 69 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 21:34:48,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316104125] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:34:48,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:34:48,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-08 21:34:48,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302455725] [2024-11-08 21:34:48,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:34:48,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 21:34:48,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:34:48,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 21:34:48,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:34:48,436 INFO L87 Difference]: Start difference. First operand 181 states and 250 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2024-11-08 21:34:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:34:48,657 INFO L93 Difference]: Finished difference Result 321 states and 429 transitions. [2024-11-08 21:34:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 21:34:48,658 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 207 [2024-11-08 21:34:48,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:34:48,659 INFO L225 Difference]: With dead ends: 321 [2024-11-08 21:34:48,659 INFO L226 Difference]: Without dead ends: 199 [2024-11-08 21:34:48,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 469 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-08 21:34:48,660 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 133 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:34:48,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 303 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:34:48,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-08 21:34:48,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 189. [2024-11-08 21:34:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 120 states have (on average 1.125) internal successors, (135), 121 states have internal predecessors, (135), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:34:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 255 transitions. [2024-11-08 21:34:48,706 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 255 transitions. Word has length 207 [2024-11-08 21:34:48,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:34:48,706 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 255 transitions. [2024-11-08 21:34:48,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2024-11-08 21:34:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 255 transitions. [2024-11-08 21:34:48,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 21:34:48,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:34:48,708 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:34:48,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 21:34:48,908 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,SelfDestructingSolverStorable10 [2024-11-08 21:34:48,909 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:34:48,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:34:48,910 INFO L85 PathProgramCache]: Analyzing trace with hash 329450047, now seen corresponding path program 1 times [2024-11-08 21:34:48,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:34:48,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68689143] [2024-11-08 21:34:48,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:34:48,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:34:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:34:48,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:34:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:34:49,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:34:49,050 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:34:49,051 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:34:49,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 21:34:49,054 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:34:49,170 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:34:49,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:34:49 BoogieIcfgContainer [2024-11-08 21:34:49,173 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:34:49,174 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:34:49,174 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:34:49,174 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:34:49,174 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:34:39" (3/4) ... [2024-11-08 21:34:49,176 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:34:49,177 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:34:49,177 INFO L158 Benchmark]: Toolchain (without parser) took 11125.94ms. Allocated memory was 151.0MB in the beginning and 415.2MB in the end (delta: 264.2MB). Free memory was 78.5MB in the beginning and 293.6MB in the end (delta: -215.1MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. [2024-11-08 21:34:49,177 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:34:49,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.59ms. Allocated memory is still 151.0MB. Free memory was 78.5MB in the beginning and 61.0MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 21:34:49,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.54ms. Allocated memory is still 151.0MB. Free memory was 61.0MB in the beginning and 57.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 21:34:49,178 INFO L158 Benchmark]: Boogie Preprocessor took 86.65ms. Allocated memory was 151.0MB in the beginning and 226.5MB in the end (delta: 75.5MB). Free memory was 57.0MB in the beginning and 196.8MB in the end (delta: -139.8MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2024-11-08 21:34:49,178 INFO L158 Benchmark]: RCFGBuilder took 524.77ms. Allocated memory is still 226.5MB. Free memory was 196.8MB in the beginning and 166.4MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 21:34:49,179 INFO L158 Benchmark]: TraceAbstraction took 10133.96ms. Allocated memory was 226.5MB in the beginning and 415.2MB in the end (delta: 188.7MB). Free memory was 165.3MB in the beginning and 293.6MB in the end (delta: -128.3MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. [2024-11-08 21:34:49,179 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 415.2MB. Free memory is still 293.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:34:49,180 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.15ms. Allocated memory is still 151.0MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.59ms. Allocated memory is still 151.0MB. Free memory was 78.5MB in the beginning and 61.0MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.54ms. Allocated memory is still 151.0MB. Free memory was 61.0MB in the beginning and 57.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.65ms. Allocated memory was 151.0MB in the beginning and 226.5MB in the end (delta: 75.5MB). Free memory was 57.0MB in the beginning and 196.8MB in the end (delta: -139.8MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * RCFGBuilder took 524.77ms. Allocated memory is still 226.5MB. Free memory was 196.8MB in the beginning and 166.4MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10133.96ms. Allocated memory was 226.5MB in the beginning and 415.2MB in the end (delta: 188.7MB). Free memory was 165.3MB in the beginning and 293.6MB in the end (delta: -128.3MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 415.2MB. Free memory is still 293.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 203, overapproximation of bitwiseOr at line 115, overapproximation of someBinaryArithmeticDOUBLEoperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_8 = 64; [L24] unsigned short int var_1_11 = 256; [L25] unsigned short int var_1_12 = 0; [L26] unsigned short int var_1_13 = 64; [L27] unsigned char var_1_14 = 1; [L28] unsigned char var_1_15 = 0; [L29] signed char var_1_16 = 50; [L30] signed char var_1_19 = -100; [L31] double var_1_20 = 100000000.8; [L32] double var_1_21 = 15.125; [L33] double var_1_22 = 99.22; [L34] signed long int var_1_23 = -16; [L35] unsigned char var_1_24 = 1; [L36] signed char var_1_25 = 10; [L37] signed char var_1_26 = 16; [L38] unsigned char var_1_27 = 0; [L39] double var_1_28 = 5.5; [L40] signed long int var_1_29 = 50; [L41] signed char var_1_31 = 4; [L42] signed char var_1_32 = 64; [L43] unsigned short int var_1_33 = 16; [L44] unsigned short int var_1_35 = 1; [L45] unsigned char var_1_39 = 4; [L46] unsigned char var_1_40 = 32; [L47] signed long int var_1_41 = -5; [L48] double var_1_42 = 49.6; [L49] double var_1_43 = 49.6; [L50] double var_1_44 = 8.2; [L51] signed long int var_1_45 = -2; [L52] unsigned long int var_1_47 = 16; [L53] unsigned long int var_1_50 = 1275815169; [L54] unsigned long int var_1_51 = 1483937619; [L55] signed short int last_1_var_1_1 = 4; [L56] unsigned char last_1_var_1_14 = 1; [L57] signed char last_1_var_1_16 = 50; [L58] signed long int last_1_var_1_23 = -16; [L59] unsigned char last_1_var_1_24 = 1; [L60] double last_1_var_1_28 = 5.5; VAL [isInitial=0, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L207] isInitial = 1 [L208] FCALL initially() [L209] COND TRUE 1 [L210] CALL updateLastVariables() [L195] last_1_var_1_1 = var_1_1 [L196] last_1_var_1_14 = var_1_14 [L197] last_1_var_1_16 = var_1_16 [L198] last_1_var_1_23 = var_1_23 [L199] last_1_var_1_24 = var_1_24 [L200] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L210] RET updateLastVariables() [L211] CALL updateVariables() [L146] var_1_11 = __VERIFIER_nondet_ushort() [L147] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L147] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L148] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L148] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L149] var_1_12 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L150] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L151] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L151] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L152] var_1_13 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L153] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L154] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L154] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L155] var_1_15 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L156] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L157] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L157] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L158] var_1_19 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L159] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L160] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L160] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L161] var_1_21 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L162] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L163] var_1_22 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L164] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L165] var_1_25 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L166] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L167] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L167] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L168] var_1_26 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L169] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L170] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L170] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L171] var_1_27 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L172] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L173] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L173] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L174] var_1_32 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_32 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L175] RET assume_abort_if_not(var_1_32 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L176] CALL assume_abort_if_not(var_1_32 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L176] RET assume_abort_if_not(var_1_32 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L177] var_1_35 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L178] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L179] CALL assume_abort_if_not(var_1_35 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L179] RET assume_abort_if_not(var_1_35 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L180] var_1_40 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L181] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L182] CALL assume_abort_if_not(var_1_40 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L182] RET assume_abort_if_not(var_1_40 <= 254) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L183] var_1_43 = __VERIFIER_nondet_double() [L184] CALL assume_abort_if_not((var_1_43 >= -922337.2036854765600e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 9223372.036854765600e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L184] RET assume_abort_if_not((var_1_43 >= -922337.2036854765600e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 9223372.036854765600e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L185] var_1_44 = __VERIFIER_nondet_double() [L186] CALL assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L186] RET assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L187] var_1_50 = __VERIFIER_nondet_ulong() [L188] CALL assume_abort_if_not(var_1_50 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L188] RET assume_abort_if_not(var_1_50 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L189] CALL assume_abort_if_not(var_1_50 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L189] RET assume_abort_if_not(var_1_50 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L190] var_1_51 = __VERIFIER_nondet_ulong() [L191] CALL assume_abort_if_not(var_1_51 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L191] RET assume_abort_if_not(var_1_51 >= 1073741824) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L192] CALL assume_abort_if_not(var_1_51 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L192] RET assume_abort_if_not(var_1_51 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L211] RET updateVariables() [L212] CALL step() [L64] signed long int stepLocal_3 = last_1_var_1_23; [L65] unsigned char stepLocal_2 = ! (last_1_var_1_14 || last_1_var_1_14); VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L66] COND FALSE !(last_1_var_1_23 < stepLocal_3) [L77] var_1_16 = 100 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L79] EXPR ((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L79] COND TRUE (((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23 [L80] var_1_23 = (5 - var_1_12) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=5, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L84] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) [L85] var_1_28 = var_1_21 [L86] unsigned char stepLocal_0 = var_1_23 > 4; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_21=2147483652, var_1_23=5, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L87] COND TRUE (var_1_23 <= var_1_23) || stepLocal_0 [L88] var_1_1 = (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L92] var_1_24 = ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27) [L93] signed char stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L94] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L94] COND TRUE stepLocal_1 > (var_1_23 + (var_1_16 ^ var_1_16)) [L95] var_1_14 = (var_1_24 || var_1_15) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L97] COND TRUE \read(var_1_14) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L98] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=50, var_1_31=4, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L102] var_1_29 = var_1_16 [L103] var_1_31 = var_1_32 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=0, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L104] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=0, var_1_32=0, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L109] COND TRUE ((((var_1_20) < (var_1_20)) ? (var_1_20) : (var_1_20))) < var_1_28 [L110] var_1_33 = var_1_35 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=0, var_1_32=0, var_1_33=-2, var_1_35=-2, var_1_39=4, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L113] var_1_39 = var_1_40 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=0, var_1_32=0, var_1_33=-2, var_1_35=-2, var_1_39=254, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L114] COND TRUE var_1_1 != var_1_8 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=0, var_1_32=0, var_1_33=-2, var_1_35=-2, var_1_39=254, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L115] EXPR -5 | var_1_8 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=0, var_1_32=0, var_1_33=-2, var_1_35=-2, var_1_39=254, var_1_40=254, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L115] COND TRUE (-5 | var_1_8) <= var_1_32 [L116] var_1_41 = ((((var_1_23) > (var_1_23)) ? (var_1_23) : (var_1_23))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=0, var_1_32=0, var_1_33=-2, var_1_35=-2, var_1_39=254, var_1_40=254, var_1_41=5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L119] COND FALSE !(1000000.4f != var_1_20) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=0, var_1_32=0, var_1_33=-2, var_1_35=-2, var_1_39=254, var_1_40=254, var_1_41=5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L124] COND FALSE !(var_1_24 && var_1_24) [L127] var_1_45 = ((var_1_32 + var_1_1) + var_1_40) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=0, var_1_32=0, var_1_33=-2, var_1_35=-2, var_1_39=254, var_1_40=254, var_1_41=5, var_1_42=248/5, var_1_45=554, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L129] COND FALSE !(var_1_20 < var_1_43) [L142] var_1_47 = var_1_1 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=0, var_1_32=0, var_1_33=-2, var_1_35=-2, var_1_39=254, var_1_40=254, var_1_41=5, var_1_42=248/5, var_1_45=554, var_1_47=300, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L212] RET step() [L213] CALL, EXPR property() [L203] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=0, var_1_32=0, var_1_33=-2, var_1_35=-2, var_1_39=254, var_1_40=254, var_1_41=5, var_1_42=248/5, var_1_45=554, var_1_47=300, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L203] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=0, var_1_32=0, var_1_33=-2, var_1_35=-2, var_1_39=254, var_1_40=254, var_1_41=5, var_1_42=248/5, var_1_45=554, var_1_47=300, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L203] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=0, var_1_32=0, var_1_33=-2, var_1_35=-2, var_1_39=254, var_1_40=254, var_1_41=5, var_1_42=248/5, var_1_45=554, var_1_47=300, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L203] EXPR (((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1)))))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=0, var_1_32=0, var_1_33=-2, var_1_35=-2, var_1_39=254, var_1_40=254, var_1_41=5, var_1_42=248/5, var_1_45=554, var_1_47=300, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L203-L204] return (((((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1))))))) && (var_1_24 == ((unsigned char) ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L213] RET, EXPR property() [L213] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=0, var_1_32=0, var_1_33=-2, var_1_35=-2, var_1_39=254, var_1_40=254, var_1_41=5, var_1_42=248/5, var_1_45=554, var_1_47=300, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=0, var_1_32=0, var_1_33=-2, var_1_35=-2, var_1_39=254, var_1_40=254, var_1_41=5, var_1_42=248/5, var_1_45=554, var_1_47=300, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 12, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2757 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2722 mSDsluCounter, 5314 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2820 mSDsCounter, 655 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1936 IncrementalHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 655 mSolverCounterUnsat, 2494 mSDtfsCounter, 1936 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1203 GetRequests, 1139 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 859 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2617 NumberOfCodeBlocks, 2617 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2603 ConstructedInterpolants, 0 QuantifiedInterpolants, 8814 SizeOfPredicates, 2 NumberOfNonLiveVariables, 489 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 22413/22620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 21:34:49,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.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 4679e818c2a87d1f6ceadee5a436eeb96f16b48c4384e7075e733b0d1dd8bd5a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:34:51,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:34:51,327 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:34:51,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:34:51,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:34:51,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:34:51,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:34:51,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:34:51,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:34:51,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:34:51,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:34:51,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:34:51,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:34:51,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:34:51,366 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:34:51,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:34:51,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:34:51,368 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:34:51,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:34:51,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:34:51,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:34:51,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:34:51,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:34:51,372 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:34:51,372 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:34:51,372 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:34:51,372 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:34:51,373 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:34:51,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:34:51,373 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:34:51,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:34:51,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:34:51,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:34:51,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:34:51,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:34:51,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:34:51,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:34:51,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:34:51,374 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:34:51,374 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:34:51,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:34:51,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:34:51,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:34:51,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:34:51,377 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 -> 4679e818c2a87d1f6ceadee5a436eeb96f16b48c4384e7075e733b0d1dd8bd5a [2024-11-08 21:34:51,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:34:51,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:34:51,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:34:51,728 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:34:51,729 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:34:51,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i [2024-11-08 21:34:53,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:34:53,294 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:34:53,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i [2024-11-08 21:34:53,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71587c9f/b63ba64a97db46d295da3fbf4ba762d5/FLAG20a70588d [2024-11-08 21:34:53,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71587c9f/b63ba64a97db46d295da3fbf4ba762d5 [2024-11-08 21:34:53,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:34:53,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:34:53,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:34:53,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:34:53,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:34:53,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:34:53" (1/1) ... [2024-11-08 21:34:53,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bc75ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:53, skipping insertion in model container [2024-11-08 21:34:53,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:34:53" (1/1) ... [2024-11-08 21:34:53,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:34:53,530 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i[919,932] [2024-11-08 21:34:53,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:34:53,606 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:34:53,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i[919,932] [2024-11-08 21:34:53,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:34:53,678 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:34:53,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:53 WrapperNode [2024-11-08 21:34:53,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:34:53,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:34:53,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:34:53,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:34:53,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:53" (1/1) ... [2024-11-08 21:34:53,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:53" (1/1) ... [2024-11-08 21:34:53,740 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-11-08 21:34:53,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:34:53,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:34:53,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:34:53,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:34:53,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:53" (1/1) ... [2024-11-08 21:34:53,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:53" (1/1) ... [2024-11-08 21:34:53,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:53" (1/1) ... [2024-11-08 21:34:53,780 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:34:53,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:53" (1/1) ... [2024-11-08 21:34:53,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:53" (1/1) ... [2024-11-08 21:34:53,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:53" (1/1) ... [2024-11-08 21:34:53,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:53" (1/1) ... [2024-11-08 21:34:53,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:53" (1/1) ... [2024-11-08 21:34:53,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:53" (1/1) ... [2024-11-08 21:34:53,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:34:53,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:34:53,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:34:53,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:34:53,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:53" (1/1) ... [2024-11-08 21:34:53,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:34:53,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:34:53,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:34:53,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:34:53,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:34:53,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:34:53,907 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:34:53,907 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:34:53,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:34:53,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:34:53,984 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:34:53,991 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:34:55,307 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-08 21:34:55,307 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:34:55,317 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:34:55,317 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:34:55,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:34:55 BoogieIcfgContainer [2024-11-08 21:34:55,318 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:34:55,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:34:55,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:34:55,321 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:34:55,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:34:53" (1/3) ... [2024-11-08 21:34:55,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee87236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:34:55, skipping insertion in model container [2024-11-08 21:34:55,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:34:53" (2/3) ... [2024-11-08 21:34:55,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee87236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:34:55, skipping insertion in model container [2024-11-08 21:34:55,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:34:55" (3/3) ... [2024-11-08 21:34:55,323 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i [2024-11-08 21:34:55,336 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:34:55,336 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:34:55,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:34:55,389 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;@b819673, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:34:55,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:34:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:34:55,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 21:34:55,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:34:55,412 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:34:55,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:34:55,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:34:55,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1727549430, now seen corresponding path program 1 times [2024-11-08 21:34:55,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:34:55,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720490967] [2024-11-08 21:34:55,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:34:55,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:34:55,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:34:55,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:34:55,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 21:34:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:55,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:34:55,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:34:55,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2024-11-08 21:34:55,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:34:55,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:34:55,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720490967] [2024-11-08 21:34:55,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720490967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:34:55,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:34:55,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:34:55,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767740697] [2024-11-08 21:34:55,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:34:55,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:34:55,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:34:55,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:34:55,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:34:55,868 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:34:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:34:55,900 INFO L93 Difference]: Finished difference Result 173 states and 308 transitions. [2024-11-08 21:34:55,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:34:55,902 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 191 [2024-11-08 21:34:55,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:34:55,910 INFO L225 Difference]: With dead ends: 173 [2024-11-08 21:34:55,910 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 21:34:55,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:34:55,918 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:34:55,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:34:55,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 21:34:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-08 21:34:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:34:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2024-11-08 21:34:55,958 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 191 [2024-11-08 21:34:55,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:34:55,962 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2024-11-08 21:34:55,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:34:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2024-11-08 21:34:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 21:34:55,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:34:55,965 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:34:55,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 21:34:56,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:34:56,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:34:56,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:34:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1181854526, now seen corresponding path program 1 times [2024-11-08 21:34:56,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:34:56,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685602787] [2024-11-08 21:34:56,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:34:56,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:34:56,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:34:56,175 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:34:56,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 21:34:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:56,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 21:34:56,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:34:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 593 proven. 69 refuted. 0 times theorem prover too weak. 1078 trivial. 0 not checked. [2024-11-08 21:34:56,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:34:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 18 proven. 69 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 21:34:57,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:34:57,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685602787] [2024-11-08 21:34:57,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685602787] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:34:57,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:34:57,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-08 21:34:57,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479685649] [2024-11-08 21:34:57,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:34:57,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 21:34:57,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:34:57,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 21:34:57,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 21:34:57,134 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2024-11-08 21:34:57,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:34:57,850 INFO L93 Difference]: Finished difference Result 188 states and 289 transitions. [2024-11-08 21:34:57,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 21:34:57,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 191 [2024-11-08 21:34:57,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:34:57,855 INFO L225 Difference]: With dead ends: 188 [2024-11-08 21:34:57,855 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 21:34:57,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 373 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-08 21:34:57,856 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 223 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 21:34:57,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 244 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 21:34:57,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 21:34:57,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2024-11-08 21:34:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 62 states have internal predecessors, (80), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 21:34:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 152 transitions. [2024-11-08 21:34:57,880 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 152 transitions. Word has length 191 [2024-11-08 21:34:57,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:34:57,880 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 152 transitions. [2024-11-08 21:34:57,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2024-11-08 21:34:57,881 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 152 transitions. [2024-11-08 21:34:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 21:34:57,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:34:57,897 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:34:57,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 21:34:58,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:34:58,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:34:58,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:34:58,099 INFO L85 PathProgramCache]: Analyzing trace with hash 130748513, now seen corresponding path program 1 times [2024-11-08 21:34:58,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:34:58,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807567087] [2024-11-08 21:34:58,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:34:58,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:34:58,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:34:58,103 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:34:58,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 21:34:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:34:58,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 21:34:58,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:34:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 879 proven. 36 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2024-11-08 21:34:58,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:34:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 51 proven. 36 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 21:34:58,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:34:58,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807567087] [2024-11-08 21:34:58,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807567087] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:34:58,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:34:58,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-08 21:34:58,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208389083] [2024-11-08 21:34:58,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:34:58,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 21:34:58,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:34:58,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 21:34:58,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 21:34:58,755 INFO L87 Difference]: Start difference. First operand 100 states and 152 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2024-11-08 21:35:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:35:00,338 INFO L93 Difference]: Finished difference Result 257 states and 377 transitions. [2024-11-08 21:35:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 21:35:00,339 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 192 [2024-11-08 21:35:00,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:35:00,341 INFO L225 Difference]: With dead ends: 257 [2024-11-08 21:35:00,342 INFO L226 Difference]: Without dead ends: 170 [2024-11-08 21:35:00,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 376 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-08 21:35:00,343 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 183 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:35:00,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 372 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 21:35:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-08 21:35:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 152. [2024-11-08 21:35:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 86 states have internal predecessors, (98), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:35:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 218 transitions. [2024-11-08 21:35:00,365 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 218 transitions. Word has length 192 [2024-11-08 21:35:00,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:35:00,365 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 218 transitions. [2024-11-08 21:35:00,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2024-11-08 21:35:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 218 transitions. [2024-11-08 21:35:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 21:35:00,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:00,368 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:35:00,385 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-11-08 21:35:00,572 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-11-08 21:35:00,573 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:00,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:00,573 INFO L85 PathProgramCache]: Analyzing trace with hash 776092771, now seen corresponding path program 1 times [2024-11-08 21:35:00,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:35:00,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865496839] [2024-11-08 21:35:00,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:00,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:35:00,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:35:00,581 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:35:00,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 21:35:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:00,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 21:35:00,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:35:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:35:01,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:35:01,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:35:01,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865496839] [2024-11-08 21:35:01,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865496839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:35:01,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:35:01,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:35:01,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716081928] [2024-11-08 21:35:01,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:35:01,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:35:01,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:35:01,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:35:01,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:35:01,281 INFO L87 Difference]: Start difference. First operand 152 states and 218 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:35:03,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:35:03,275 INFO L93 Difference]: Finished difference Result 336 states and 482 transitions. [2024-11-08 21:35:03,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 21:35:03,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 192 [2024-11-08 21:35:03,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:35:03,283 INFO L225 Difference]: With dead ends: 336 [2024-11-08 21:35:03,283 INFO L226 Difference]: Without dead ends: 247 [2024-11-08 21:35:03,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:35:03,284 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 171 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 21:35:03,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 305 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 21:35:03,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-08 21:35:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 164. [2024-11-08 21:35:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 98 states have internal predecessors, (113), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:35:03,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2024-11-08 21:35:03,345 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 192 [2024-11-08 21:35:03,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:35:03,346 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2024-11-08 21:35:03,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:35:03,346 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2024-11-08 21:35:03,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-08 21:35:03,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:03,359 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:35:03,372 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-11-08 21:35:03,560 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-11-08 21:35:03,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:03,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:03,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1389633321, now seen corresponding path program 1 times [2024-11-08 21:35:03,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:35:03,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230002106] [2024-11-08 21:35:03,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:03,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:35:03,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:35:03,569 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-11-08 21:35:03,573 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-11-08 21:35:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:03,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 21:35:03,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:35:21,213 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 21:35:40,950 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 21:36:01,308 WARN L286 SmtUtils]: Spent 9.31s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)