./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_fillercodesize_ps-cn-25_file-53.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 450871023bc04af6c52574b6b5134ab77c34540023c7d8e038f27ba262fd77fd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:26:19,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:26:19,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:26:19,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:26:19,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:26:19,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:26:19,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:26:19,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:26:19,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:26:19,116 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:26:19,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:26:19,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:26:19,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:26:19,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:26:19,118 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:26:19,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:26:19,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:26:19,122 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:26:19,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:26:19,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:26:19,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:26:19,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:26:19,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:26:19,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:26:19,125 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:26:19,125 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:26:19,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:26:19,126 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:26:19,126 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:26:19,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:26:19,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:26:19,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:26:19,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:26:19,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:26:19,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:26:19,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:26:19,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:26:19,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:26:19,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:26:19,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:26:19,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:26:19,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:26:19,129 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 -> 450871023bc04af6c52574b6b5134ab77c34540023c7d8e038f27ba262fd77fd [2024-11-10 04:26:19,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:26:19,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:26:19,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:26:19,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:26:19,354 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:26:19,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2024-11-10 04:26:20,565 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:26:20,727 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:26:20,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2024-11-10 04:26:20,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92c1173f5/a88c622153954e33a1d5a788e11351cc/FLAG68eb3e3a5 [2024-11-10 04:26:21,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92c1173f5/a88c622153954e33a1d5a788e11351cc [2024-11-10 04:26:21,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:26:21,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:26:21,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:26:21,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:26:21,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:26:21,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:26:21" (1/1) ... [2024-11-10 04:26:21,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b53b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:21, skipping insertion in model container [2024-11-10 04:26:21,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:26:21" (1/1) ... [2024-11-10 04:26:21,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:26:21,317 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_fillercodesize_ps-cn-25_file-53.i[915,928] [2024-11-10 04:26:21,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:26:21,381 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:26:21,390 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_fillercodesize_ps-cn-25_file-53.i[915,928] [2024-11-10 04:26:21,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:26:21,437 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:26:21,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:21 WrapperNode [2024-11-10 04:26:21,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:26:21,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:26:21,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:26:21,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:26:21,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:21" (1/1) ... [2024-11-10 04:26:21,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:21" (1/1) ... [2024-11-10 04:26:21,486 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 265 [2024-11-10 04:26:21,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:26:21,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:26:21,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:26:21,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:26:21,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:21" (1/1) ... [2024-11-10 04:26:21,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:21" (1/1) ... [2024-11-10 04:26:21,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:21" (1/1) ... [2024-11-10 04:26:21,513 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-10 04:26:21,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:21" (1/1) ... [2024-11-10 04:26:21,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:21" (1/1) ... [2024-11-10 04:26:21,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:21" (1/1) ... [2024-11-10 04:26:21,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:21" (1/1) ... [2024-11-10 04:26:21,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:21" (1/1) ... [2024-11-10 04:26:21,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:21" (1/1) ... [2024-11-10 04:26:21,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:26:21,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:26:21,532 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:26:21,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:26:21,533 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:21" (1/1) ... [2024-11-10 04:26:21,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:26:21,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:26:21,562 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-10 04:26:21,563 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-10 04:26:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:26:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:26:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:26:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:26:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:26:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:26:21,667 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:26:21,672 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:26:21,929 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L179: havoc property_#t~ite27#1;havoc property_#t~bitwise26#1;havoc property_#t~short28#1;havoc property_#t~bitwise29#1;havoc property_#t~short30#1; [2024-11-10 04:26:21,980 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-10 04:26:21,980 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:26:22,007 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:26:22,007 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-10 04:26:22,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:26:22 BoogieIcfgContainer [2024-11-10 04:26:22,008 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:26:22,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:26:22,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:26:22,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:26:22,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:26:21" (1/3) ... [2024-11-10 04:26:22,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274ed065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:26:22, skipping insertion in model container [2024-11-10 04:26:22,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:21" (2/3) ... [2024-11-10 04:26:22,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274ed065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:26:22, skipping insertion in model container [2024-11-10 04:26:22,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:26:22" (3/3) ... [2024-11-10 04:26:22,017 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2024-11-10 04:26:22,031 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:26:22,031 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:26:22,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:26:22,079 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;@4d66eb76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:26:22,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:26:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 04:26:22,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-10 04:26:22,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:22,094 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:22,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:22,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:22,098 INFO L85 PathProgramCache]: Analyzing trace with hash 781082932, now seen corresponding path program 1 times [2024-11-10 04:26:22,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:26:22,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481455059] [2024-11-10 04:26:22,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:22,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:26:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:26:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:26:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:26:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:26:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:26:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:26:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:26:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:26:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:26:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:26:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:26:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:26:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:26:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:26:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:26:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:26:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:26:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:26:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:26:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:26:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:26:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:26:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:26:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:26:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:26:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:26:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:26:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:26:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:26:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:26:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 04:26:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 04:26:22,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:26:22,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481455059] [2024-11-10 04:26:22,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481455059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:26:22,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:26:22,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:26:22,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163554104] [2024-11-10 04:26:22,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:26:22,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:26:22,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:26:22,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:26:22,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:26:22,573 INFO L87 Difference]: Start difference. First operand has 114 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-10 04:26:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:26:22,609 INFO L93 Difference]: Finished difference Result 220 states and 370 transitions. [2024-11-10 04:26:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:26:22,612 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 204 [2024-11-10 04:26:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:26:22,618 INFO L225 Difference]: With dead ends: 220 [2024-11-10 04:26:22,618 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 04:26:22,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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-10 04:26:22,623 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:26:22,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:26:22,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 04:26:22,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-10 04:26:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 04:26:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 165 transitions. [2024-11-10 04:26:22,659 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 165 transitions. Word has length 204 [2024-11-10 04:26:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:26:22,660 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 165 transitions. [2024-11-10 04:26:22,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-10 04:26:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 165 transitions. [2024-11-10 04:26:22,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-10 04:26:22,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:22,663 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:22,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:26:22,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:22,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash -223195499, now seen corresponding path program 1 times [2024-11-10 04:26:22,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:26:22,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013819979] [2024-11-10 04:26:22,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:22,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:26:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:26:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:26:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:26:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:26:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:26:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:26:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:26:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:26:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:26:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:26:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:26:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:26:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:26:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:26:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:26:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:26:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:26:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:26:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:26:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:26:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:26:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:26:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:26:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:26:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:26:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:26:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:26:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:26:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:26:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:26:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 04:26:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 04:26:22,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:26:22,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013819979] [2024-11-10 04:26:22,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013819979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:26:22,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:26:22,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:26:22,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534116190] [2024-11-10 04:26:22,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:26:22,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:26:22,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:26:22,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:26:22,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:26:22,964 INFO L87 Difference]: Start difference. First operand 109 states and 165 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:26:23,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:26:23,053 INFO L93 Difference]: Finished difference Result 312 states and 474 transitions. [2024-11-10 04:26:23,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:26:23,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2024-11-10 04:26:23,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:26:23,057 INFO L225 Difference]: With dead ends: 312 [2024-11-10 04:26:23,058 INFO L226 Difference]: Without dead ends: 206 [2024-11-10 04:26:23,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-10 04:26:23,062 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 142 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:26:23,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 415 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:26:23,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-10 04:26:23,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2024-11-10 04:26:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 138 states have (on average 1.326086956521739) internal successors, (183), 138 states have internal predecessors, (183), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-10 04:26:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 307 transitions. [2024-11-10 04:26:23,092 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 307 transitions. Word has length 204 [2024-11-10 04:26:23,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:26:23,093 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 307 transitions. [2024-11-10 04:26:23,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:26:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 307 transitions. [2024-11-10 04:26:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 04:26:23,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:23,101 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:23,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:26:23,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:23,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:23,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1993483936, now seen corresponding path program 1 times [2024-11-10 04:26:23,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:26:23,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951435111] [2024-11-10 04:26:23,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:23,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:26:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:26:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:26:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:26:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:26:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:26:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:26:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:26:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:26:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:26:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:26:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:26:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:26:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:26:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:26:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:26:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:26:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:26:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:26:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:26:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:26:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:26:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:26:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:26:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:26:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:26:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:26:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:26:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:26:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:26:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:26:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 04:26:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 04:26:23,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:26:23,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951435111] [2024-11-10 04:26:23,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951435111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:26:23,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:26:23,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:26:23,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708336564] [2024-11-10 04:26:23,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:26:23,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:26:23,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:26:23,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:26:23,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:26:23,496 INFO L87 Difference]: Start difference. First operand 203 states and 307 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:26:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:26:23,736 INFO L93 Difference]: Finished difference Result 659 states and 991 transitions. [2024-11-10 04:26:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:26:23,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2024-11-10 04:26:23,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:26:23,740 INFO L225 Difference]: With dead ends: 659 [2024-11-10 04:26:23,745 INFO L226 Difference]: Without dead ends: 459 [2024-11-10 04:26:23,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:26:23,747 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 169 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:26:23,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 465 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:26:23,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-10 04:26:23,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 437. [2024-11-10 04:26:23,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 308 states have (on average 1.3344155844155845) internal successors, (411), 308 states have internal predecessors, (411), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-10 04:26:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 659 transitions. [2024-11-10 04:26:23,806 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 659 transitions. Word has length 205 [2024-11-10 04:26:23,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:26:23,808 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 659 transitions. [2024-11-10 04:26:23,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:26:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 659 transitions. [2024-11-10 04:26:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-10 04:26:23,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:23,812 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:23,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:26:23,813 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:23,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:23,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1236078609, now seen corresponding path program 1 times [2024-11-10 04:26:23,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:26:23,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854285317] [2024-11-10 04:26:23,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:23,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:26:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:26:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:26:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:26:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:26:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:26:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:26:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:26:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:26:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:26:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:26:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:23,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:26:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:26:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:26:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:26:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:26:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:26:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:26:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:26:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:26:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:26:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:26:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:26:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:26:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:26:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:26:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:26:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:26:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:26:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:26:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:26:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 04:26:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 04:26:24,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:26:24,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854285317] [2024-11-10 04:26:24,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854285317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:26:24,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:26:24,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:26:24,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504684951] [2024-11-10 04:26:24,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:26:24,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:26:24,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:26:24,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:26:24,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:26:24,064 INFO L87 Difference]: Start difference. First operand 437 states and 659 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:26:24,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:26:24,125 INFO L93 Difference]: Finished difference Result 1100 states and 1665 transitions. [2024-11-10 04:26:24,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:26:24,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2024-11-10 04:26:24,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:26:24,131 INFO L225 Difference]: With dead ends: 1100 [2024-11-10 04:26:24,133 INFO L226 Difference]: Without dead ends: 666 [2024-11-10 04:26:24,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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-10 04:26:24,135 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 90 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:26:24,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 319 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:26:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-11-10 04:26:24,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 663. [2024-11-10 04:26:24,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 470 states have (on average 1.3319148936170213) internal successors, (626), 470 states have internal predecessors, (626), 186 states have call successors, (186), 6 states have call predecessors, (186), 6 states have return successors, (186), 186 states have call predecessors, (186), 186 states have call successors, (186) [2024-11-10 04:26:24,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 998 transitions. [2024-11-10 04:26:24,195 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 998 transitions. Word has length 206 [2024-11-10 04:26:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:26:24,197 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 998 transitions. [2024-11-10 04:26:24,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:26:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 998 transitions. [2024-11-10 04:26:24,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-10 04:26:24,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:24,200 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:24,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:26:24,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:24,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:24,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1289589148, now seen corresponding path program 1 times [2024-11-10 04:26:24,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:26:24,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39433248] [2024-11-10 04:26:24,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:24,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:26:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:26:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:26:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:26:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:26:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:26:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:26:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:26:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:26:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:26:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:26:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:26:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:26:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:26:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:26:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:26:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:26:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:26:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:26:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:26:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:26:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:26:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:26:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:26:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:26:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:26:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:26:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:26:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:26:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:26:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:26:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 04:26:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 04:26:24,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:26:24,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39433248] [2024-11-10 04:26:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39433248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:26:24,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:26:24,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:26:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360490544] [2024-11-10 04:26:24,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:26:24,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:26:24,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:26:24,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:26:24,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:26:24,466 INFO L87 Difference]: Start difference. First operand 663 states and 998 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:26:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:26:24,588 INFO L93 Difference]: Finished difference Result 666 states and 1000 transitions. [2024-11-10 04:26:24,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:26:24,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2024-11-10 04:26:24,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:26:24,590 INFO L225 Difference]: With dead ends: 666 [2024-11-10 04:26:24,590 INFO L226 Difference]: Without dead ends: 232 [2024-11-10 04:26:24,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:26:24,593 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 162 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:26:24,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 145 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:26:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-10 04:26:24,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2024-11-10 04:26:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 167 states have (on average 1.3053892215568863) internal successors, (218), 167 states have internal predecessors, (218), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-10 04:26:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 342 transitions. [2024-11-10 04:26:24,609 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 342 transitions. Word has length 207 [2024-11-10 04:26:24,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:26:24,609 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 342 transitions. [2024-11-10 04:26:24,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:26:24,609 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 342 transitions. [2024-11-10 04:26:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-10 04:26:24,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:24,611 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:24,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 04:26:24,611 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:24,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:24,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1237825601, now seen corresponding path program 1 times [2024-11-10 04:26:24,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:26:24,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396649161] [2024-11-10 04:26:24,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:24,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:26:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:26:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:26:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:26:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:26:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:26:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:26:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:26:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:26:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:26:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:26:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:26:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:26:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:26:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:26:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:26:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:26:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:26:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:26:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:26:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:26:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:26:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:26:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:26:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:26:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:26:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:26:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:26:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:26:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:26:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:26:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 04:26:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 04:26:24,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:26:24,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396649161] [2024-11-10 04:26:24,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396649161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:26:24,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:26:24,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:26:24,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360482755] [2024-11-10 04:26:24,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:26:24,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:26:24,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:26:24,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:26:24,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:26:24,757 INFO L87 Difference]: Start difference. First operand 232 states and 342 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:26:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:26:24,853 INFO L93 Difference]: Finished difference Result 682 states and 1009 transitions. [2024-11-10 04:26:24,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:26:24,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2024-11-10 04:26:24,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:26:24,857 INFO L225 Difference]: With dead ends: 682 [2024-11-10 04:26:24,857 INFO L226 Difference]: Without dead ends: 453 [2024-11-10 04:26:24,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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-10 04:26:24,859 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 151 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:26:24,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 413 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:26:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-10 04:26:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 238. [2024-11-10 04:26:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 173 states have (on average 1.2947976878612717) internal successors, (224), 173 states have internal predecessors, (224), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-10 04:26:24,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 348 transitions. [2024-11-10 04:26:24,889 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 348 transitions. Word has length 207 [2024-11-10 04:26:24,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:26:24,890 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 348 transitions. [2024-11-10 04:26:24,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:26:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 348 transitions. [2024-11-10 04:26:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-10 04:26:24,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:24,892 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:24,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 04:26:24,892 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:24,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:24,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1108742882, now seen corresponding path program 1 times [2024-11-10 04:26:24,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:26:24,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066564369] [2024-11-10 04:26:24,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:24,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:26:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:26:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:26:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:26:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:26:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:26:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:26:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:26:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:26:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:26:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:26:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:26:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:26:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:26:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:26:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:26:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:26:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:26:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:26:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:26:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:26:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:26:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:26:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:26:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:26:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:26:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:26:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:26:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:26:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:26:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:26:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 04:26:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 72 proven. 18 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-10 04:26:25,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:26:25,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066564369] [2024-11-10 04:26:25,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066564369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:26:25,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544702810] [2024-11-10 04:26:25,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:25,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:26:25,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:26:25,260 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-10 04:26:25,261 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-10 04:26:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:25,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 04:26:25,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:26:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 960 proven. 45 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2024-11-10 04:26:25,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:26:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-10 04:26:26,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544702810] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:26:26,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:26:26,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 21 [2024-11-10 04:26:26,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787516976] [2024-11-10 04:26:26,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:26:26,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 04:26:26,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:26:26,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 04:26:26,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2024-11-10 04:26:26,357 INFO L87 Difference]: Start difference. First operand 238 states and 348 transitions. Second operand has 21 states, 21 states have (on average 7.095238095238095) internal successors, (149), 21 states have internal predecessors, (149), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2024-11-10 04:26:31,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:26:31,047 INFO L93 Difference]: Finished difference Result 1387 states and 1961 transitions. [2024-11-10 04:26:31,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-10 04:26:31,048 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.095238095238095) internal successors, (149), 21 states have internal predecessors, (149), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) Word has length 207 [2024-11-10 04:26:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:26:31,056 INFO L225 Difference]: With dead ends: 1387 [2024-11-10 04:26:31,056 INFO L226 Difference]: Without dead ends: 1152 [2024-11-10 04:26:31,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 476 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4612 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2232, Invalid=10878, Unknown=0, NotChecked=0, Total=13110 [2024-11-10 04:26:31,061 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 1509 mSDsluCounter, 4476 mSDsCounter, 0 mSdLazyCounter, 4744 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 4999 SdHoareTripleChecker+Invalid, 5612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 4744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-10 04:26:31,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 4999 Invalid, 5612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 4744 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-10 04:26:31,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2024-11-10 04:26:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 482. [2024-11-10 04:26:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 347 states have (on average 1.2708933717579252) internal successors, (441), 347 states have internal predecessors, (441), 124 states have call successors, (124), 10 states have call predecessors, (124), 10 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-10 04:26:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 689 transitions. [2024-11-10 04:26:31,131 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 689 transitions. Word has length 207 [2024-11-10 04:26:31,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:26:31,132 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 689 transitions. [2024-11-10 04:26:31,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.095238095238095) internal successors, (149), 21 states have internal predecessors, (149), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2024-11-10 04:26:31,132 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 689 transitions. [2024-11-10 04:26:31,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-10 04:26:31,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:31,134 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:31,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 04:26:31,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:26:31,336 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:31,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:31,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2120449744, now seen corresponding path program 1 times [2024-11-10 04:26:31,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:26:31,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357204737] [2024-11-10 04:26:31,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:31,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:26:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:26:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:26:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:26:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:26:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:26:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:26:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:26:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:26:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:26:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:26:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:26:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:26:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:26:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:26:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:26:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:26:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:26:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:26:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:26:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:26:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:26:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:26:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:26:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:26:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:26:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:26:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:26:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:26:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:26:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:26:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 04:26:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 72 proven. 18 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-10 04:26:31,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:26:31,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357204737] [2024-11-10 04:26:31,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357204737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:26:31,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593773037] [2024-11-10 04:26:31,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:31,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:26:31,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:26:31,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:26:31,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 04:26:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:31,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 04:26:31,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:26:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 654 proven. 18 refuted. 0 times theorem prover too weak. 1188 trivial. 0 not checked. [2024-11-10 04:26:31,848 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:26:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 72 proven. 18 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-10 04:26:32,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593773037] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:26:32,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:26:32,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-10 04:26:32,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961894404] [2024-11-10 04:26:32,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:26:32,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 04:26:32,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:26:32,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 04:26:32,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-10 04:26:32,070 INFO L87 Difference]: Start difference. First operand 482 states and 689 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 3 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2024-11-10 04:26:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:26:32,794 INFO L93 Difference]: Finished difference Result 997 states and 1416 transitions. [2024-11-10 04:26:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 04:26:32,795 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 3 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) Word has length 209 [2024-11-10 04:26:32,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:26:32,800 INFO L225 Difference]: With dead ends: 997 [2024-11-10 04:26:32,800 INFO L226 Difference]: Without dead ends: 760 [2024-11-10 04:26:32,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2024-11-10 04:26:32,802 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 364 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 04:26:32,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 948 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 04:26:32,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-11-10 04:26:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 740. [2024-11-10 04:26:32,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 525 states have (on average 1.259047619047619) internal successors, (661), 528 states have internal predecessors, (661), 196 states have call successors, (196), 18 states have call predecessors, (196), 18 states have return successors, (196), 193 states have call predecessors, (196), 196 states have call successors, (196) [2024-11-10 04:26:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1053 transitions. [2024-11-10 04:26:32,886 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1053 transitions. Word has length 209 [2024-11-10 04:26:32,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:26:32,887 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1053 transitions. [2024-11-10 04:26:32,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 3 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2024-11-10 04:26:32,887 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1053 transitions. [2024-11-10 04:26:32,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 04:26:32,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:32,888 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:32,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 04:26:33,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-10 04:26:33,093 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:33,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:33,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1089580721, now seen corresponding path program 1 times [2024-11-10 04:26:33,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:26:33,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691483462] [2024-11-10 04:26:33,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:33,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:26:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:26:33,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [943336858] [2024-11-10 04:26:33,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:33,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:26:33,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:26:33,165 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:26:33,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 04:26:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:26:33,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:26:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:26:33,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:26:33,592 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:26:33,592 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:26:33,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 04:26:33,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:26:33,797 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:26:33,902 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:26:33,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:26:33 BoogieIcfgContainer [2024-11-10 04:26:33,904 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:26:33,904 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:26:33,904 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:26:33,905 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:26:33,905 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:26:22" (3/4) ... [2024-11-10 04:26:33,907 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:26:33,907 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:26:33,908 INFO L158 Benchmark]: Toolchain (without parser) took 12777.88ms. Allocated memory was 155.2MB in the beginning and 308.3MB in the end (delta: 153.1MB). Free memory was 84.4MB in the beginning and 166.8MB in the end (delta: -82.5MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. [2024-11-10 04:26:33,908 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 110.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:26:33,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.35ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 117.1MB in the end (delta: -33.0MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-11-10 04:26:33,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.94ms. Allocated memory is still 155.2MB. Free memory was 117.1MB in the beginning and 112.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:26:33,909 INFO L158 Benchmark]: Boogie Preprocessor took 43.99ms. Allocated memory is still 155.2MB. Free memory was 112.9MB in the beginning and 108.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:26:33,909 INFO L158 Benchmark]: IcfgBuilder took 475.91ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 78.3MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-10 04:26:33,909 INFO L158 Benchmark]: TraceAbstraction took 11893.16ms. Allocated memory was 155.2MB in the beginning and 308.3MB in the end (delta: 153.1MB). Free memory was 77.7MB in the beginning and 166.8MB in the end (delta: -89.1MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2024-11-10 04:26:33,909 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 308.3MB. Free memory is still 166.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:26:33,910 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.14ms. Allocated memory is still 155.2MB. Free memory is still 110.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.35ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 117.1MB in the end (delta: -33.0MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.94ms. Allocated memory is still 155.2MB. Free memory was 117.1MB in the beginning and 112.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.99ms. Allocated memory is still 155.2MB. Free memory was 112.9MB in the beginning and 108.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 475.91ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 78.3MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11893.16ms. Allocated memory was 155.2MB in the beginning and 308.3MB in the end (delta: 153.1MB). Free memory was 77.7MB in the beginning and 166.8MB in the end (delta: -89.1MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 308.3MB. Free memory is still 166.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of shiftLeft at line 87, overapproximation of someBinaryArithmeticFLOAToperation at line 93, overapproximation of someUnaryFLOAToperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_8 = 0; [L24] unsigned long int var_1_9 = 10; [L25] float var_1_10 = 99.5; [L26] float var_1_11 = 5.6; [L27] float var_1_12 = 255.5; [L28] float var_1_13 = 31.25; [L29] signed short int var_1_14 = 32; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_16 = 1; [L32] unsigned char var_1_17 = 5; [L33] unsigned char var_1_18 = 50; [L34] unsigned char var_1_19 = 50; [L35] signed char var_1_20 = 1; [L36] signed char var_1_21 = -10; [L37] float var_1_22 = 0.5; [L38] signed char var_1_23 = 100; [L39] signed short int var_1_24 = 2; [L40] signed short int var_1_25 = 5; [L41] unsigned short int var_1_26 = 500; [L42] unsigned char var_1_27 = 1; [L43] signed short int var_1_28 = -32; [L44] unsigned short int var_1_29 = 54921; [L45] unsigned char var_1_30 = 1; [L46] unsigned char var_1_31 = 0; [L47] unsigned char var_1_32 = 0; [L48] double var_1_33 = 10000000000000.8; [L49] float var_1_34 = 0.125; [L50] float var_1_35 = 8.5; [L51] float var_1_36 = 7.5; [L52] float var_1_37 = 3.2; [L53] unsigned char last_1_var_1_1 = 0; [L54] unsigned long int last_1_var_1_9 = 10; [L55] signed short int last_1_var_1_14 = 32; [L56] unsigned char last_1_var_1_16 = 1; [L57] signed char last_1_var_1_20 = 1; VAL [isInitial=0, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=0, var_1_9=10] [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_9 = var_1_9 [L174] last_1_var_1_14 = var_1_14 [L175] last_1_var_1_16 = var_1_16 [L176] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=0, var_1_9=10] [L186] RET updateLastVariables() [L187] CALL updateVariables() [L122] var_1_8 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L123] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L124] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L124] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L125] var_1_11 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L126] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L127] var_1_12 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L128] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L129] var_1_13 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L130] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L131] var_1_15 = __VERIFIER_nondet_ulong() [L132] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L132] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L133] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L133] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L134] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L134] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L135] var_1_17 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L136] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L137] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L137] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L138] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L138] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L139] var_1_18 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L140] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L141] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L141] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L142] var_1_19 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L143] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L144] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L144] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L145] var_1_21 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L146] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L147] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L147] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L148] var_1_25 = __VERIFIER_nondet_short() [L149] CALL assume_abort_if_not(var_1_25 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L149] RET assume_abort_if_not(var_1_25 >= -32767) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L150] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L150] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L151] var_1_27 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L152] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L153] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L153] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L154] var_1_28 = __VERIFIER_nondet_short() [L155] CALL assume_abort_if_not(var_1_28 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L155] RET assume_abort_if_not(var_1_28 >= -32768) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L156] CALL assume_abort_if_not(var_1_28 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L156] RET assume_abort_if_not(var_1_28 <= 32767) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L157] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L157] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L158] var_1_29 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L159] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L160] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L160] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L161] var_1_31 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L162] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L163] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L163] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L164] var_1_35 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 4611686.018427382800e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L165] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 4611686.018427382800e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L166] var_1_36 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_37=16/5, var_1_8=1, var_1_9=10] [L167] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_37=16/5, var_1_8=1, var_1_9=10] [L168] var_1_37 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_37 >= -461168.6018427382800e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L169] RET assume_abort_if_not((var_1_37 >= -461168.6018427382800e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L187] RET updateVariables() [L188] CALL step() [L61] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L62] COND FALSE !(\read(var_1_27)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L67] COND TRUE ((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29))) >= ((((-16) > (((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))) ? (-16) : (((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25)))))) [L68] var_1_30 = (! var_1_31) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L70] var_1_32 = 1 [L71] var_1_33 = 5.25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] EXPR var_1_26 >> var_1_25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] EXPR ((var_1_29) < ((var_1_26 >> var_1_25))) ? (var_1_29) : ((var_1_26 >> var_1_25)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] EXPR var_1_26 >> var_1_25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] EXPR ((var_1_29) < ((var_1_26 >> var_1_25))) ? (var_1_29) : ((var_1_26 >> var_1_25)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] COND FALSE !(((((var_1_29) < ((var_1_26 >> var_1_25))) ? (var_1_29) : ((var_1_26 >> var_1_25)))) <= var_1_28) [L77] var_1_34 = var_1_35 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L79] unsigned char stepLocal_1 = last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16); [L80] signed long int stepLocal_0 = last_1_var_1_20 * last_1_var_1_20; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L81] COND FALSE !(stepLocal_0 == last_1_var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L86] unsigned long int stepLocal_6 = ((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L87] EXPR 256u << last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L87] COND TRUE stepLocal_6 <= (256u << last_1_var_1_16) [L88] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=5, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L90] unsigned char stepLocal_5 = var_1_16 != var_1_16; [L91] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=5, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L92] COND TRUE (! var_1_1) || stepLocal_4 [L93] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_13=0, var_1_14=32, var_1_15=6, var_1_16=5, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L101] var_1_20 = var_1_21 [L102] var_1_22 = var_1_12 [L103] var_1_23 = var_1_21 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=32, var_1_15=6, var_1_16=5, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L104] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=32, var_1_15=6, var_1_16=5, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L107] EXPR (var_1_16 / var_1_15) & var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=32, var_1_15=6, var_1_16=5, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L107] COND TRUE ((var_1_16 / var_1_15) & var_1_16) >= var_1_20 [L108] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L113] unsigned char stepLocal_3 = var_1_20 != var_1_14; [L114] signed long int stepLocal_2 = (((var_1_16) < (0)) ? (var_1_16) : (0)); VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_3=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L115] COND TRUE (var_1_1 || (var_1_16 <= var_1_14)) || stepLocal_3 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L116] COND TRUE stepLocal_2 <= (-5 + var_1_16) [L117] var_1_9 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=5] [L188] RET step() [L189] CALL, EXPR property() [L179] EXPR (((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=5] [L179] EXPR ((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=5] [L179-L180] return (((((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=-1, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 9, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2637 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2587 mSDsluCounter, 7863 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5924 mSDsCounter, 1324 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5764 IncrementalHoareTripleChecker+Invalid, 7088 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1324 mSolverCounterUnsat, 1939 mSDtfsCounter, 5764 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1513 GetRequests, 1366 SyntacticMatches, 2 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4687 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=740occurred in iteration=8, InterpolantAutomatonStates: 133, 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, 8 MinimizatonAttempts, 933 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2485 NumberOfCodeBlocks, 2485 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2469 ConstructedInterpolants, 0 QuantifiedInterpolants, 5691 SizeOfPredicates, 8 NumberOfNonLiveVariables, 977 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 22158/22320 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-10 04:26:33,952 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_fillercodesize_ps-cn-25_file-53.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 450871023bc04af6c52574b6b5134ab77c34540023c7d8e038f27ba262fd77fd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:26:35,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:26:35,800 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 04:26:35,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:26:35,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:26:35,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:26:35,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:26:35,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:26:35,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:26:35,836 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:26:35,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:26:35,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:26:35,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:26:35,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:26:35,837 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:26:35,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:26:35,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:26:35,838 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:26:35,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:26:35,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:26:35,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:26:35,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:26:35,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:26:35,842 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 04:26:35,842 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 04:26:35,842 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:26:35,843 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 04:26:35,843 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:26:35,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:26:35,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:26:35,843 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:26:35,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:26:35,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:26:35,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:26:35,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:26:35,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:26:35,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:26:35,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:26:35,845 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 04:26:35,845 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 04:26:35,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:26:35,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:26:35,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:26:35,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:26:35,848 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 -> 450871023bc04af6c52574b6b5134ab77c34540023c7d8e038f27ba262fd77fd [2024-11-10 04:26:36,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:26:36,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:26:36,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:26:36,121 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:26:36,121 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:26:36,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2024-11-10 04:26:37,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:26:37,587 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:26:37,590 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2024-11-10 04:26:37,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7610fd80/2a4cf93b744f4ea5aa5299797e73ea0f/FLAGa8a45efcb [2024-11-10 04:26:37,980 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7610fd80/2a4cf93b744f4ea5aa5299797e73ea0f [2024-11-10 04:26:37,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:26:37,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:26:37,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:26:37,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:26:37,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:26:37,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:26:37" (1/1) ... [2024-11-10 04:26:37,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb42cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:37, skipping insertion in model container [2024-11-10 04:26:37,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:26:37" (1/1) ... [2024-11-10 04:26:38,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:26:38,151 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_fillercodesize_ps-cn-25_file-53.i[915,928] [2024-11-10 04:26:38,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:26:38,212 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:26:38,221 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_fillercodesize_ps-cn-25_file-53.i[915,928] [2024-11-10 04:26:38,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:26:38,269 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:26:38,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:38 WrapperNode [2024-11-10 04:26:38,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:26:38,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:26:38,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:26:38,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:26:38,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:38" (1/1) ... [2024-11-10 04:26:38,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:38" (1/1) ... [2024-11-10 04:26:38,309 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-11-10 04:26:38,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:26:38,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:26:38,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:26:38,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:26:38,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:38" (1/1) ... [2024-11-10 04:26:38,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:38" (1/1) ... [2024-11-10 04:26:38,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:38" (1/1) ... [2024-11-10 04:26:38,342 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-10 04:26:38,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:38" (1/1) ... [2024-11-10 04:26:38,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:38" (1/1) ... [2024-11-10 04:26:38,357 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:38" (1/1) ... [2024-11-10 04:26:38,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:38" (1/1) ... [2024-11-10 04:26:38,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:38" (1/1) ... [2024-11-10 04:26:38,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:38" (1/1) ... [2024-11-10 04:26:38,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:26:38,375 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:26:38,375 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:26:38,375 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:26:38,376 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:38" (1/1) ... [2024-11-10 04:26:38,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:26:38,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:26:38,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:26:38,410 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-10 04:26:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:26:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 04:26:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:26:38,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:26:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:26:38,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:26:38,523 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:26:38,527 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:26:39,117 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-10 04:26:39,118 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:26:39,127 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:26:39,129 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:26:39,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:26:39 BoogieIcfgContainer [2024-11-10 04:26:39,129 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:26:39,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:26:39,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:26:39,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:26:39,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:26:37" (1/3) ... [2024-11-10 04:26:39,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0a86dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:26:39, skipping insertion in model container [2024-11-10 04:26:39,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:38" (2/3) ... [2024-11-10 04:26:39,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0a86dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:26:39, skipping insertion in model container [2024-11-10 04:26:39,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:26:39" (3/3) ... [2024-11-10 04:26:39,137 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2024-11-10 04:26:39,150 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:26:39,150 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:26:39,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:26:39,203 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;@1409869a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:26:39,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:26:39,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 57 states have internal predecessors, (75), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 04:26:39,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-10 04:26:39,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:39,219 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:39,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:39,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:39,225 INFO L85 PathProgramCache]: Analyzing trace with hash 568639101, now seen corresponding path program 1 times [2024-11-10 04:26:39,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:26:39,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568011030] [2024-11-10 04:26:39,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:39,236 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-10 04:26:39,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:26:39,240 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-10 04:26:39,241 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-10 04:26:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:39,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 04:26:39,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:26:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 1476 trivial. 0 not checked. [2024-11-10 04:26:39,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:26:39,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:26:39,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568011030] [2024-11-10 04:26:39,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568011030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:26:39,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:26:39,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:26:39,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281290197] [2024-11-10 04:26:39,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:26:39,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:26:39,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:26:39,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:26:39,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:26:39,665 INFO L87 Difference]: Start difference. First operand has 90 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 57 states have internal predecessors, (75), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-10 04:26:39,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:26:39,696 INFO L93 Difference]: Finished difference Result 172 states and 298 transitions. [2024-11-10 04:26:39,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:26:39,699 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 197 [2024-11-10 04:26:39,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:26:39,705 INFO L225 Difference]: With dead ends: 172 [2024-11-10 04:26:39,705 INFO L226 Difference]: Without dead ends: 85 [2024-11-10 04:26:39,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 196 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-10 04:26:39,713 INFO L432 NwaCegarLoop]: 129 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, 129 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-10 04:26:39,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:26:39,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-10 04:26:39,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-10 04:26:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 04:26:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 129 transitions. [2024-11-10 04:26:39,764 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 129 transitions. Word has length 197 [2024-11-10 04:26:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:26:39,765 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 129 transitions. [2024-11-10 04:26:39,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-10 04:26:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 129 transitions. [2024-11-10 04:26:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-10 04:26:39,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:39,771 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:39,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 04:26:39,971 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-10 04:26:39,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:39,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1600957500, now seen corresponding path program 1 times [2024-11-10 04:26:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:26:39,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970578871] [2024-11-10 04:26:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:39,974 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-10 04:26:39,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:26:39,976 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-10 04:26:39,977 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-10 04:26:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:40,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 04:26:40,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:26:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 04:26:40,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:26:40,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:26:40,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970578871] [2024-11-10 04:26:40,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970578871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:26:40,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:26:40,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:26:40,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604447264] [2024-11-10 04:26:40,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:26:40,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:26:40,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:26:40,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:26:40,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:26:40,560 INFO L87 Difference]: Start difference. First operand 85 states and 129 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:26:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:26:40,790 INFO L93 Difference]: Finished difference Result 247 states and 377 transitions. [2024-11-10 04:26:40,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:26:40,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2024-11-10 04:26:40,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:26:40,795 INFO L225 Difference]: With dead ends: 247 [2024-11-10 04:26:40,795 INFO L226 Difference]: Without dead ends: 165 [2024-11-10 04:26:40,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 195 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-10 04:26:40,799 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 24 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:26:40,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 243 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:26:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-10 04:26:40,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2024-11-10 04:26:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-10 04:26:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 247 transitions. [2024-11-10 04:26:40,827 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 247 transitions. Word has length 197 [2024-11-10 04:26:40,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:26:40,831 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 247 transitions. [2024-11-10 04:26:40,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:26:40,834 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 247 transitions. [2024-11-10 04:26:40,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-10 04:26:40,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:40,841 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:40,852 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-10 04:26:41,042 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-10 04:26:41,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:41,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:41,043 INFO L85 PathProgramCache]: Analyzing trace with hash 931711853, now seen corresponding path program 1 times [2024-11-10 04:26:41,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:26:41,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851117423] [2024-11-10 04:26:41,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:41,044 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-10 04:26:41,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:26:41,047 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-10 04:26:41,048 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-10 04:26:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:41,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 04:26:41,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:26:42,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 04:26:42,082 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:26:42,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:26:42,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851117423] [2024-11-10 04:26:42,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851117423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:26:42,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:26:42,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:26:42,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989954109] [2024-11-10 04:26:42,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:26:42,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:26:42,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:26:42,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:26:42,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:26:42,084 INFO L87 Difference]: Start difference. First operand 162 states and 247 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:26:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:26:42,709 INFO L93 Difference]: Finished difference Result 403 states and 613 transitions. [2024-11-10 04:26:42,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:26:42,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2024-11-10 04:26:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:26:42,723 INFO L225 Difference]: With dead ends: 403 [2024-11-10 04:26:42,723 INFO L226 Difference]: Without dead ends: 244 [2024-11-10 04:26:42,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:26:42,725 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 74 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 04:26:42,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 423 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 04:26:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-10 04:26:42,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 225. [2024-11-10 04:26:42,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 128 states have (on average 1.2421875) internal successors, (159), 128 states have internal predecessors, (159), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-10 04:26:42,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 345 transitions. [2024-11-10 04:26:42,777 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 345 transitions. Word has length 198 [2024-11-10 04:26:42,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:26:42,779 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 345 transitions. [2024-11-10 04:26:42,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:26:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 345 transitions. [2024-11-10 04:26:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-10 04:26:42,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:42,782 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:42,795 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-10 04:26:42,984 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-10 04:26:42,984 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:42,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:42,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1452227433, now seen corresponding path program 1 times [2024-11-10 04:26:42,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:26:42,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004095892] [2024-11-10 04:26:42,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:42,986 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-10 04:26:42,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:26:42,987 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-10 04:26:42,987 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-10 04:26:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:43,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 04:26:43,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:26:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 04:26:43,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:26:43,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:26:43,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004095892] [2024-11-10 04:26:43,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004095892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:26:43,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:26:43,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:26:43,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840780388] [2024-11-10 04:26:43,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:26:43,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:26:43,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:26:43,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:26:43,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:26:43,228 INFO L87 Difference]: Start difference. First operand 225 states and 345 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:26:43,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:26:43,493 INFO L93 Difference]: Finished difference Result 472 states and 722 transitions. [2024-11-10 04:26:43,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:26:43,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2024-11-10 04:26:43,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:26:43,499 INFO L225 Difference]: With dead ends: 472 [2024-11-10 04:26:43,499 INFO L226 Difference]: Without dead ends: 313 [2024-11-10 04:26:43,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 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-10 04:26:43,501 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 120 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:26:43,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 358 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:26:43,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-10 04:26:43,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 227. [2024-11-10 04:26:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 130 states have (on average 1.2384615384615385) internal successors, (161), 130 states have internal predecessors, (161), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-10 04:26:43,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 347 transitions. [2024-11-10 04:26:43,542 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 347 transitions. Word has length 198 [2024-11-10 04:26:43,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:26:43,543 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 347 transitions. [2024-11-10 04:26:43,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:26:43,543 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 347 transitions. [2024-11-10 04:26:43,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-10 04:26:43,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:43,546 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:43,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 04:26:43,746 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-10 04:26:43,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:43,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:43,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1099929528, now seen corresponding path program 1 times [2024-11-10 04:26:43,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:26:43,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169717123] [2024-11-10 04:26:43,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:43,748 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-10 04:26:43,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:26:43,751 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-10 04:26:43,752 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-10 04:26:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:43,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 04:26:43,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:26:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 960 proven. 45 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2024-11-10 04:26:44,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:26:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-10 04:26:44,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:26:44,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169717123] [2024-11-10 04:26:44,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169717123] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:26:44,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:26:44,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-11-10 04:26:44,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305521801] [2024-11-10 04:26:44,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:26:44,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 04:26:44,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:26:44,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 04:26:44,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-10 04:26:44,403 INFO L87 Difference]: Start difference. First operand 227 states and 347 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-10 04:26:45,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:26:45,839 INFO L93 Difference]: Finished difference Result 503 states and 749 transitions. [2024-11-10 04:26:45,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 04:26:45,842 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 198 [2024-11-10 04:26:45,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:26:45,845 INFO L225 Difference]: With dead ends: 503 [2024-11-10 04:26:45,845 INFO L226 Difference]: Without dead ends: 342 [2024-11-10 04:26:45,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 386 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2024-11-10 04:26:45,846 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 408 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:26:45,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 680 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 04:26:45,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-10 04:26:45,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 237. [2024-11-10 04:26:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 137 states have (on average 1.218978102189781) internal successors, (167), 137 states have internal predecessors, (167), 93 states have call successors, (93), 6 states have call predecessors, (93), 6 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-10 04:26:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 353 transitions. [2024-11-10 04:26:45,889 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 353 transitions. Word has length 198 [2024-11-10 04:26:45,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:26:45,890 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 353 transitions. [2024-11-10 04:26:45,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-10 04:26:45,890 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 353 transitions. [2024-11-10 04:26:45,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 04:26:45,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:45,892 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:45,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 04:26:46,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:26:46,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:46,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:46,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1212410556, now seen corresponding path program 1 times [2024-11-10 04:26:46,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:26:46,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236327480] [2024-11-10 04:26:46,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:46,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-10 04:26:46,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:26:46,101 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:26:46,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 04:26:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:46,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 04:26:46,309 INFO L278 TraceCheckSpWp]: Computing forward predicates...