./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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-4.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 cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:19:50,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:19:50,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 13:19:50,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:19:50,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:19:50,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:19:50,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:19:50,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:19:50,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:19:50,681 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:19:50,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:19:50,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:19:50,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:19:50,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:19:50,683 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:19:50,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:19:50,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:19:50,684 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:19:50,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 13:19:50,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:19:50,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:19:50,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:19:50,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:19:50,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:19:50,688 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:19:50,688 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:19:50,689 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:19:50,689 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:19:50,689 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:19:50,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:19:50,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:19:50,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:19:50,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:19:50,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:19:50,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:19:50,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:19:50,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 13:19:50,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 13:19:50,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:19:50,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:19:50,693 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:19:50,693 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:19:50,693 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 -> cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 [2024-11-16 13:19:50,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:19:50,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:19:50,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:19:50,959 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:19:50,960 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:19:50,961 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-4.i [2024-11-16 13:19:52,311 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:19:52,565 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:19:52,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-16 13:19:52,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cf1e0393/10831da11aff4e20a8ba185f937c9a48/FLAG5bd3c3ce9 [2024-11-16 13:19:52,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cf1e0393/10831da11aff4e20a8ba185f937c9a48 [2024-11-16 13:19:52,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:19:52,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:19:52,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:19:52,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:19:52,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:19:52,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:19:52" (1/1) ... [2024-11-16 13:19:52,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53198724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:52, skipping insertion in model container [2024-11-16 13:19:52,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:19:52" (1/1) ... [2024-11-16 13:19:52,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:19:53,120 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-4.i[914,927] [2024-11-16 13:19:53,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:19:53,230 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:19:53,244 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-4.i[914,927] [2024-11-16 13:19:53,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:19:53,317 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:19:53,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:53 WrapperNode [2024-11-16 13:19:53,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:19:53,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:19:53,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:19:53,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:19:53,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:53" (1/1) ... [2024-11-16 13:19:53,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:53" (1/1) ... [2024-11-16 13:19:53,377 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-16 13:19:53,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:19:53,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:19:53,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:19:53,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:19:53,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:53" (1/1) ... [2024-11-16 13:19:53,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:53" (1/1) ... [2024-11-16 13:19:53,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:53" (1/1) ... [2024-11-16 13:19:53,409 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-16 13:19:53,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:53" (1/1) ... [2024-11-16 13:19:53,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:53" (1/1) ... [2024-11-16 13:19:53,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:53" (1/1) ... [2024-11-16 13:19:53,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:53" (1/1) ... [2024-11-16 13:19:53,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:53" (1/1) ... [2024-11-16 13:19:53,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:53" (1/1) ... [2024-11-16 13:19:53,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:19:53,442 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:19:53,442 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:19:53,442 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:19:53,443 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:53" (1/1) ... [2024-11-16 13:19:53,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:19:53,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:19:53,480 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-16 13:19:53,483 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-16 13:19:53,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:19:53,535 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:19:53,536 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:19:53,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 13:19:53,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:19:53,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:19:53,650 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:19:53,653 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:19:54,144 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-16 13:19:54,146 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:19:54,162 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:19:54,163 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:19:54,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:19:54 BoogieIcfgContainer [2024-11-16 13:19:54,163 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:19:54,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:19:54,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:19:54,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:19:54,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:19:52" (1/3) ... [2024-11-16 13:19:54,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4adb588e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:19:54, skipping insertion in model container [2024-11-16 13:19:54,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:53" (2/3) ... [2024-11-16 13:19:54,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4adb588e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:19:54, skipping insertion in model container [2024-11-16 13:19:54,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:19:54" (3/3) ... [2024-11-16 13:19:54,172 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-16 13:19:54,188 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:19:54,188 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:19:54,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:19:54,261 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;@74a7bda6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:19:54,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:19:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 59 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-16 13:19:54,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-16 13:19:54,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:19:54,289 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:19:54,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:19:54,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:19:54,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1471072572, now seen corresponding path program 1 times [2024-11-16 13:19:54,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:19:54,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048254495] [2024-11-16 13:19:54,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:19:54,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:19:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:19:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:19:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:19:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:19:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:19:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:19:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:19:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 13:19:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 13:19:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:19:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:19:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:19:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 13:19:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:19:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 13:19:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:19:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 13:19:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:19:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:19:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:19:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:19:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:19:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:19:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:19:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:19:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:19:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:19:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 13:19:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 13:19:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 13:19:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 13:19:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 13:19:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 13:19:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 13:19:54,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:19:54,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048254495] [2024-11-16 13:19:54,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048254495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:19:54,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:19:54,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:19:54,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98698713] [2024-11-16 13:19:54,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:19:54,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:19:54,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:19:54,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:19:54,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:19:54,941 INFO L87 Difference]: Start difference. First operand has 94 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 59 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-16 13:19:54,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:19:54,987 INFO L93 Difference]: Finished difference Result 180 states and 316 transitions. [2024-11-16 13:19:54,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:19:54,989 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 209 [2024-11-16 13:19:54,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:19:54,999 INFO L225 Difference]: With dead ends: 180 [2024-11-16 13:19:54,999 INFO L226 Difference]: Without dead ends: 89 [2024-11-16 13:19:55,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-16 13:19:55,009 INFO L432 NwaCegarLoop]: 136 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, 136 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-16 13:19:55,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:19:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-16 13:19:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-16 13:19:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-16 13:19:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 136 transitions. [2024-11-16 13:19:55,071 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 136 transitions. Word has length 209 [2024-11-16 13:19:55,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:19:55,071 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 136 transitions. [2024-11-16 13:19:55,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-16 13:19:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 136 transitions. [2024-11-16 13:19:55,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-16 13:19:55,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:19:55,079 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:19:55,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 13:19:55,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:19:55,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:19:55,080 INFO L85 PathProgramCache]: Analyzing trace with hash 601280196, now seen corresponding path program 1 times [2024-11-16 13:19:55,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:19:55,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970710312] [2024-11-16 13:19:55,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:19:55,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:19:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:19:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:19:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:19:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:19:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:19:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:19:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:19:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 13:19:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 13:19:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:19:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:19:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:19:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 13:19:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:19:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 13:19:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:19:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 13:19:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:19:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:19:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:19:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:19:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:19:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:19:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:19:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:19:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:19:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:19:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 13:19:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 13:19:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 13:19:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 13:19:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 13:19:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 13:19:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 13:19:56,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:19:56,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970710312] [2024-11-16 13:19:56,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970710312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:19:56,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:19:56,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 13:19:56,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901937154] [2024-11-16 13:19:56,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:19:56,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:19:56,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:19:56,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:19:56,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:19:56,351 INFO L87 Difference]: Start difference. First operand 89 states and 136 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 13:19:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:19:56,735 INFO L93 Difference]: Finished difference Result 292 states and 439 transitions. [2024-11-16 13:19:56,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 13:19:56,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-11-16 13:19:56,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:19:56,740 INFO L225 Difference]: With dead ends: 292 [2024-11-16 13:19:56,741 INFO L226 Difference]: Without dead ends: 206 [2024-11-16 13:19:56,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 13:19:56,744 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 188 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 13:19:56,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 545 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 13:19:56,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-16 13:19:56,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 176. [2024-11-16 13:19:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 107 states have internal predecessors, (139), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-16 13:19:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 271 transitions. [2024-11-16 13:19:56,784 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 271 transitions. Word has length 210 [2024-11-16 13:19:56,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:19:56,785 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 271 transitions. [2024-11-16 13:19:56,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 13:19:56,785 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 271 transitions. [2024-11-16 13:19:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-16 13:19:56,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:19:56,788 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:19:56,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 13:19:56,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:19:56,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:19:56,790 INFO L85 PathProgramCache]: Analyzing trace with hash 629909347, now seen corresponding path program 1 times [2024-11-16 13:19:56,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:19:56,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110969289] [2024-11-16 13:19:56,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:19:56,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:19:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:19:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:19:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:19:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:19:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:19:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:19:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:19:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 13:19:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 13:19:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:19:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:19:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:19:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 13:19:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:19:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 13:19:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:19:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 13:19:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:19:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:19:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:19:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:19:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:19:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:19:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:19:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:19:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:19:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:19:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 13:19:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 13:19:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 13:19:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 13:19:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 13:19:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 13:19:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:57,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 13:19:57,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:19:57,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110969289] [2024-11-16 13:19:57,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110969289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:19:57,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:19:57,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 13:19:57,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927386811] [2024-11-16 13:19:57,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:19:57,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:19:57,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:19:57,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:19:57,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:19:57,508 INFO L87 Difference]: Start difference. First operand 176 states and 271 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-16 13:19:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:19:57,783 INFO L93 Difference]: Finished difference Result 478 states and 735 transitions. [2024-11-16 13:19:57,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:19:57,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 210 [2024-11-16 13:19:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:19:57,788 INFO L225 Difference]: With dead ends: 478 [2024-11-16 13:19:57,788 INFO L226 Difference]: Without dead ends: 305 [2024-11-16 13:19:57,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 13:19:57,792 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 311 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:19:57,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 243 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:19:57,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-16 13:19:57,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 300. [2024-11-16 13:19:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 189 states have (on average 1.3174603174603174) internal successors, (249), 191 states have internal predecessors, (249), 106 states have call successors, (106), 4 states have call predecessors, (106), 4 states have return successors, (106), 104 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-16 13:19:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 461 transitions. [2024-11-16 13:19:57,861 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 461 transitions. Word has length 210 [2024-11-16 13:19:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:19:57,863 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 461 transitions. [2024-11-16 13:19:57,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-16 13:19:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 461 transitions. [2024-11-16 13:19:57,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-16 13:19:57,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:19:57,867 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:19:57,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 13:19:57,868 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:19:57,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:19:57,868 INFO L85 PathProgramCache]: Analyzing trace with hash -367163006, now seen corresponding path program 1 times [2024-11-16 13:19:57,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:19:57,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122504599] [2024-11-16 13:19:57,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:19:57,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:19:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:20:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:20:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:20:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:20:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:20:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:20:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:20:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 13:20:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 13:20:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:20:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:20:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:20:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 13:20:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:20:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 13:20:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:20:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 13:20:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:20:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:20:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:20:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:20:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:20:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:20:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:20:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:20:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:20:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:20:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 13:20:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 13:20:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 13:20:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 13:20:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 13:20:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 13:20:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 13:20:03,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:20:03,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122504599] [2024-11-16 13:20:03,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122504599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:20:03,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:20:03,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 13:20:03,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705099679] [2024-11-16 13:20:03,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:20:03,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 13:20:03,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:20:03,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 13:20:03,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-16 13:20:03,270 INFO L87 Difference]: Start difference. First operand 300 states and 461 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 13:20:04,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:20:04,774 INFO L93 Difference]: Finished difference Result 935 states and 1396 transitions. [2024-11-16 13:20:04,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 13:20:04,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-11-16 13:20:04,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:20:04,785 INFO L225 Difference]: With dead ends: 935 [2024-11-16 13:20:04,785 INFO L226 Difference]: Without dead ends: 638 [2024-11-16 13:20:04,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-16 13:20:04,790 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 177 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:20:04,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 760 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 13:20:04,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-16 13:20:04,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 434. [2024-11-16 13:20:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 288 states have (on average 1.3194444444444444) internal successors, (380), 290 states have internal predecessors, (380), 139 states have call successors, (139), 6 states have call predecessors, (139), 6 states have return successors, (139), 137 states have call predecessors, (139), 139 states have call successors, (139) [2024-11-16 13:20:04,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 658 transitions. [2024-11-16 13:20:04,869 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 658 transitions. Word has length 210 [2024-11-16 13:20:04,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:20:04,869 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 658 transitions. [2024-11-16 13:20:04,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 13:20:04,870 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 658 transitions. [2024-11-16 13:20:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-16 13:20:04,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:20:04,872 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:20:04,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 13:20:04,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:20:04,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:20:04,874 INFO L85 PathProgramCache]: Analyzing trace with hash -660566013, now seen corresponding path program 1 times [2024-11-16 13:20:04,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:20:04,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905688327] [2024-11-16 13:20:04,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:04,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:20:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:20:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:20:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:20:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:20:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:20:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:20:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:20:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 13:20:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 13:20:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:20:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:20:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:20:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 13:20:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:20:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 13:20:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:20:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 13:20:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:20:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:20:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:20:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:20:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:20:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:20:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:20:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:20:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:20:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:20:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 13:20:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 13:20:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 13:20:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 13:20:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 13:20:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 13:20:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 13:20:05,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:20:05,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905688327] [2024-11-16 13:20:05,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905688327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:20:05,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:20:05,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:20:05,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951686369] [2024-11-16 13:20:05,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:20:05,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:20:05,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:20:05,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:20:05,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:20:05,325 INFO L87 Difference]: Start difference. First operand 434 states and 658 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 13:20:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:20:05,430 INFO L93 Difference]: Finished difference Result 1042 states and 1592 transitions. [2024-11-16 13:20:05,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:20:05,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-11-16 13:20:05,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:20:05,438 INFO L225 Difference]: With dead ends: 1042 [2024-11-16 13:20:05,439 INFO L226 Difference]: Without dead ends: 731 [2024-11-16 13:20:05,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-16 13:20:05,444 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 67 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 269 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.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:20:05,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 269 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:20:05,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-16 13:20:05,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 728. [2024-11-16 13:20:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 472 states have (on average 1.305084745762712) internal successors, (616), 476 states have internal predecessors, (616), 245 states have call successors, (245), 10 states have call predecessors, (245), 10 states have return successors, (245), 241 states have call predecessors, (245), 245 states have call successors, (245) [2024-11-16 13:20:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1106 transitions. [2024-11-16 13:20:05,542 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1106 transitions. Word has length 210 [2024-11-16 13:20:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:20:05,543 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1106 transitions. [2024-11-16 13:20:05,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 13:20:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1106 transitions. [2024-11-16 13:20:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-16 13:20:05,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:20:05,546 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:20:05,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 13:20:05,546 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:20:05,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:20:05,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1923900804, now seen corresponding path program 1 times [2024-11-16 13:20:05,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:20:05,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937002061] [2024-11-16 13:20:05,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:05,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:20:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:20:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:20:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:20:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:20:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:20:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:20:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:20:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 13:20:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 13:20:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:20:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:20:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:20:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 13:20:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:20:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 13:20:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:20:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 13:20:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:20:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:20:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:20:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:20:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:20:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:20:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:20:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:20:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:20:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:20:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 13:20:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 13:20:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 13:20:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 13:20:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 13:20:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 13:20:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-16 13:20:05,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:20:05,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937002061] [2024-11-16 13:20:05,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937002061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:20:05,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178353961] [2024-11-16 13:20:05,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:05,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:20:05,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:20:05,989 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-16 13:20:05,990 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-16 13:20:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:06,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 13:20:06,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:20:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 386 proven. 87 refuted. 0 times theorem prover too weak. 1639 trivial. 0 not checked. [2024-11-16 13:20:06,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:20:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-16 13:20:06,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178353961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:20:06,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 13:20:06,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-16 13:20:06,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667403081] [2024-11-16 13:20:06,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 13:20:06,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 13:20:06,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:20:06,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 13:20:06,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:20:06,889 INFO L87 Difference]: Start difference. First operand 728 states and 1106 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-16 13:20:07,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:20:07,177 INFO L93 Difference]: Finished difference Result 1367 states and 2033 transitions. [2024-11-16 13:20:07,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 13:20:07,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 211 [2024-11-16 13:20:07,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:20:07,186 INFO L225 Difference]: With dead ends: 1367 [2024-11-16 13:20:07,187 INFO L226 Difference]: Without dead ends: 768 [2024-11-16 13:20:07,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 484 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-16 13:20:07,190 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 77 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:20:07,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 207 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:20:07,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-16 13:20:07,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 702. [2024-11-16 13:20:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 437 states have (on average 1.2013729977116705) internal successors, (525), 441 states have internal predecessors, (525), 245 states have call successors, (245), 19 states have call predecessors, (245), 19 states have return successors, (245), 241 states have call predecessors, (245), 245 states have call successors, (245) [2024-11-16 13:20:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1015 transitions. [2024-11-16 13:20:07,344 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1015 transitions. Word has length 211 [2024-11-16 13:20:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:20:07,344 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1015 transitions. [2024-11-16 13:20:07,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-16 13:20:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1015 transitions. [2024-11-16 13:20:07,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-16 13:20:07,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:20:07,348 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:20:07,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 13:20:07,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 13:20:07,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:20:07,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:20:07,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1606668668, now seen corresponding path program 1 times [2024-11-16 13:20:07,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:20:07,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715493358] [2024-11-16 13:20:07,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:07,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:20:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:20:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:20:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:20:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:20:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:20:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:20:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:20:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 13:20:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 13:20:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:20:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:20:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:20:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 13:20:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:20:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 13:20:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:20:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 13:20:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:20:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:20:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:20:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:20:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:20:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:20:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:20:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:20:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:20:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:20:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 13:20:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 13:20:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 13:20:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 13:20:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 13:20:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 13:20:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 13:20:07,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:20:07,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715493358] [2024-11-16 13:20:07,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715493358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:20:07,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:20:07,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:20:07,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496547221] [2024-11-16 13:20:07,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:20:07,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:20:07,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:20:07,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:20:07,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:20:07,849 INFO L87 Difference]: Start difference. First operand 702 states and 1015 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 13:20:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:20:08,139 INFO L93 Difference]: Finished difference Result 1286 states and 1865 transitions. [2024-11-16 13:20:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:20:08,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2024-11-16 13:20:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:20:08,150 INFO L225 Difference]: With dead ends: 1286 [2024-11-16 13:20:08,150 INFO L226 Difference]: Without dead ends: 987 [2024-11-16 13:20:08,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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-16 13:20:08,154 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 131 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:20:08,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 506 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:20:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-11-16 13:20:08,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 980. [2024-11-16 13:20:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 601 states have (on average 1.1896838602329451) internal successors, (715), 607 states have internal predecessors, (715), 351 states have call successors, (351), 27 states have call predecessors, (351), 27 states have return successors, (351), 345 states have call predecessors, (351), 351 states have call successors, (351) [2024-11-16 13:20:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1417 transitions. [2024-11-16 13:20:08,303 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1417 transitions. Word has length 211 [2024-11-16 13:20:08,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:20:08,304 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1417 transitions. [2024-11-16 13:20:08,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 13:20:08,304 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1417 transitions. [2024-11-16 13:20:08,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-16 13:20:08,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:20:08,306 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:20:08,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 13:20:08,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:20:08,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:20:08,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1803182173, now seen corresponding path program 1 times [2024-11-16 13:20:08,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:20:08,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832668299] [2024-11-16 13:20:08,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:08,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:20:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:20:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:20:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:20:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:20:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:20:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:20:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:20:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 13:20:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 13:20:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:20:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:20:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:20:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 13:20:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:20:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 13:20:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:20:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 13:20:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:20:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:20:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:20:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:20:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:20:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:20:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:20:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:20:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:20:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:20:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 13:20:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 13:20:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 13:20:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 13:20:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 13:20:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 13:20:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 60 proven. 210 refuted. 0 times theorem prover too weak. 1842 trivial. 0 not checked. [2024-11-16 13:20:09,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:20:09,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832668299] [2024-11-16 13:20:09,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832668299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:20:09,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049547836] [2024-11-16 13:20:09,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:09,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:20:09,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:20:09,465 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-16 13:20:09,467 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-16 13:20:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:09,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-16 13:20:09,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:20:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 828 proven. 402 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2024-11-16 13:20:13,167 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:20:33,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049547836] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:20:33,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 13:20:33,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 28 [2024-11-16 13:20:33,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925518036] [2024-11-16 13:20:33,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 13:20:33,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-16 13:20:33,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:20:33,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-16 13:20:33,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=1289, Unknown=1, NotChecked=0, Total=1722 [2024-11-16 13:20:33,775 INFO L87 Difference]: Start difference. First operand 980 states and 1417 transitions. Second operand has 28 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 26 states have internal predecessors, (110), 10 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 10 states have call predecessors, (66), 10 states have call successors, (66) [2024-11-16 13:20:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:20:38,347 INFO L93 Difference]: Finished difference Result 1709 states and 2278 transitions. [2024-11-16 13:20:38,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-11-16 13:20:38,348 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 26 states have internal predecessors, (110), 10 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 10 states have call predecessors, (66), 10 states have call successors, (66) Word has length 211 [2024-11-16 13:20:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:20:38,354 INFO L225 Difference]: With dead ends: 1709 [2024-11-16 13:20:38,355 INFO L226 Difference]: Without dead ends: 1114 [2024-11-16 13:20:38,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3815 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=2997, Invalid=9884, Unknown=1, NotChecked=0, Total=12882 [2024-11-16 13:20:38,363 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 788 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-16 13:20:38,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 996 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-16 13:20:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2024-11-16 13:20:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 761. [2024-11-16 13:20:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 494 states have (on average 1.1417004048582995) internal successors, (564), 499 states have internal predecessors, (564), 208 states have call successors, (208), 58 states have call predecessors, (208), 58 states have return successors, (208), 203 states have call predecessors, (208), 208 states have call successors, (208) [2024-11-16 13:20:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 980 transitions. [2024-11-16 13:20:38,485 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 980 transitions. Word has length 211 [2024-11-16 13:20:38,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:20:38,486 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 980 transitions. [2024-11-16 13:20:38,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 26 states have internal predecessors, (110), 10 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 10 states have call predecessors, (66), 10 states have call successors, (66) [2024-11-16 13:20:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 980 transitions. [2024-11-16 13:20:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-16 13:20:38,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:20:38,489 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:20:38,515 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-16 13:20:38,690 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-16 13:20:38,690 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:20:38,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:20:38,691 INFO L85 PathProgramCache]: Analyzing trace with hash 923540486, now seen corresponding path program 1 times [2024-11-16 13:20:38,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:20:38,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693916315] [2024-11-16 13:20:38,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:38,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:20:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:20:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:20:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:20:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:20:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:20:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:20:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:20:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 13:20:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 13:20:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:20:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:20:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:20:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 13:20:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:20:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 13:20:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:20:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 13:20:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:20:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:20:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:20:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:20:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:20:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:20:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:20:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:20:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:20:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:20:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 13:20:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 13:20:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 13:20:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 13:20:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 13:20:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 13:20:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-16 13:20:39,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:20:39,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693916315] [2024-11-16 13:20:39,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693916315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:20:39,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152193024] [2024-11-16 13:20:39,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:39,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:20:39,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:20:39,156 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-16 13:20:39,157 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-16 13:20:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:39,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 13:20:39,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:20:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 158 proven. 93 refuted. 0 times theorem prover too weak. 1861 trivial. 0 not checked. [2024-11-16 13:20:39,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:20:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-16 13:20:40,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152193024] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:20:40,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 13:20:40,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-16 13:20:40,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108859267] [2024-11-16 13:20:40,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 13:20:40,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 13:20:40,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:20:40,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 13:20:40,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 13:20:40,224 INFO L87 Difference]: Start difference. First operand 761 states and 980 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-16 13:20:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:20:41,145 INFO L93 Difference]: Finished difference Result 1805 states and 2266 transitions. [2024-11-16 13:20:41,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 13:20:41,146 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) Word has length 211 [2024-11-16 13:20:41,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:20:41,158 INFO L225 Difference]: With dead ends: 1805 [2024-11-16 13:20:41,158 INFO L226 Difference]: Without dead ends: 1155 [2024-11-16 13:20:41,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 482 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-16 13:20:41,162 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 138 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 13:20:41,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 698 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 13:20:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-16 13:20:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 801. [2024-11-16 13:20:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 528 states have (on average 1.1325757575757576) internal successors, (598), 533 states have internal predecessors, (598), 208 states have call successors, (208), 64 states have call predecessors, (208), 64 states have return successors, (208), 203 states have call predecessors, (208), 208 states have call successors, (208) [2024-11-16 13:20:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1014 transitions. [2024-11-16 13:20:41,316 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1014 transitions. Word has length 211 [2024-11-16 13:20:41,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:20:41,317 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1014 transitions. [2024-11-16 13:20:41,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-16 13:20:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1014 transitions. [2024-11-16 13:20:41,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-16 13:20:41,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:20:41,319 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:20:41,338 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-16 13:20:41,520 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-16 13:20:41,520 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:20:41,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:20:41,521 INFO L85 PathProgramCache]: Analyzing trace with hash 952169637, now seen corresponding path program 1 times [2024-11-16 13:20:41,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:20:41,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121117553] [2024-11-16 13:20:41,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:41,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:20:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:20:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:20:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:20:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:20:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:20:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:20:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:20:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 13:20:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 13:20:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:20:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:20:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:20:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 13:20:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:20:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 13:20:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:20:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 13:20:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:20:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:20:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:20:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:20:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:20:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:20:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:20:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:20:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:20:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:20:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 13:20:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 13:20:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 13:20:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 13:20:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 13:20:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 13:20:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 13:20:41,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:20:41,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121117553] [2024-11-16 13:20:41,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121117553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:20:41,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:20:41,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:20:41,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137516000] [2024-11-16 13:20:41,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:20:41,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:20:41,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:20:41,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:20:41,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:20:41,712 INFO L87 Difference]: Start difference. First operand 801 states and 1014 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 13:20:41,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:20:41,823 INFO L93 Difference]: Finished difference Result 1306 states and 1646 transitions. [2024-11-16 13:20:41,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:20:41,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2024-11-16 13:20:41,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:20:41,830 INFO L225 Difference]: With dead ends: 1306 [2024-11-16 13:20:41,830 INFO L226 Difference]: Without dead ends: 592 [2024-11-16 13:20:41,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 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-16 13:20:41,833 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:20:41,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:20:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-11-16 13:20:41,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2024-11-16 13:20:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 388 states have (on average 1.1134020618556701) internal successors, (432), 392 states have internal predecessors, (432), 155 states have call successors, (155), 48 states have call predecessors, (155), 48 states have return successors, (155), 151 states have call predecessors, (155), 155 states have call successors, (155) [2024-11-16 13:20:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 742 transitions. [2024-11-16 13:20:41,942 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 742 transitions. Word has length 211 [2024-11-16 13:20:41,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:20:41,943 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 742 transitions. [2024-11-16 13:20:41,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 13:20:41,944 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 742 transitions. [2024-11-16 13:20:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-16 13:20:41,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:20:41,947 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:20:41,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 13:20:41,947 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:20:41,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:20:41,948 INFO L85 PathProgramCache]: Analyzing trace with hash 637937601, now seen corresponding path program 1 times [2024-11-16 13:20:41,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:20:41,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535326397] [2024-11-16 13:20:41,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:41,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:20:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:20:42,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1062358284] [2024-11-16 13:20:42,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:42,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:20:42,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:20:42,127 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 13:20:42,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 13:20:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:20:42,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 13:20:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:20:42,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 13:20:42,475 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 13:20:42,477 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 13:20:42,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 13:20:42,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:20:42,683 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:20:42,850 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 13:20:42,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 01:20:42 BoogieIcfgContainer [2024-11-16 13:20:42,855 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 13:20:42,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 13:20:42,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 13:20:42,856 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 13:20:42,857 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:19:54" (3/4) ... [2024-11-16 13:20:42,859 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 13:20:42,860 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 13:20:42,861 INFO L158 Benchmark]: Toolchain (without parser) took 49961.80ms. Allocated memory was 163.6MB in the beginning and 564.1MB in the end (delta: 400.6MB). Free memory was 107.9MB in the beginning and 430.4MB in the end (delta: -322.5MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2024-11-16 13:20:42,862 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:20:42,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.33ms. Allocated memory is still 163.6MB. Free memory was 107.9MB in the beginning and 90.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 13:20:42,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.44ms. Allocated memory is still 163.6MB. Free memory was 90.0MB in the beginning and 86.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 13:20:42,862 INFO L158 Benchmark]: Boogie Preprocessor took 62.52ms. Allocated memory is still 163.6MB. Free memory was 86.6MB in the beginning and 82.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 13:20:42,862 INFO L158 Benchmark]: IcfgBuilder took 721.59ms. Allocated memory is still 163.6MB. Free memory was 82.4MB in the beginning and 113.3MB in the end (delta: -30.9MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-11-16 13:20:42,863 INFO L158 Benchmark]: TraceAbstraction took 48689.84ms. Allocated memory was 163.6MB in the beginning and 564.1MB in the end (delta: 400.6MB). Free memory was 113.3MB in the beginning and 431.5MB in the end (delta: -318.1MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. [2024-11-16 13:20:42,863 INFO L158 Benchmark]: Witness Printer took 4.73ms. Allocated memory is still 564.1MB. Free memory was 431.5MB in the beginning and 430.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 13:20:42,865 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.13ms. Allocated memory is still 163.6MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.33ms. Allocated memory is still 163.6MB. Free memory was 107.9MB in the beginning and 90.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.44ms. Allocated memory is still 163.6MB. Free memory was 90.0MB in the beginning and 86.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.52ms. Allocated memory is still 163.6MB. Free memory was 86.6MB in the beginning and 82.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 721.59ms. Allocated memory is still 163.6MB. Free memory was 82.4MB in the beginning and 113.3MB in the end (delta: -30.9MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * TraceAbstraction took 48689.84ms. Allocated memory was 163.6MB in the beginning and 564.1MB in the end (delta: 400.6MB). Free memory was 113.3MB in the beginning and 431.5MB in the end (delta: -318.1MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. * Witness Printer took 4.73ms. Allocated memory is still 564.1MB. Free memory was 431.5MB in the beginning and 430.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 186, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryArithmeticDOUBLEoperation at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] signed char var_1_23 = 1; [L40] signed char var_1_24 = 2; [L41] signed short int var_1_25 = -500; [L42] signed char var_1_26 = -2; [L43] float var_1_27 = 31.25; [L44] float var_1_28 = 2.95; [L45] signed char var_1_29 = 10; [L46] double var_1_30 = 0.5; [L47] unsigned char var_1_31 = 0; [L48] unsigned short int var_1_32 = 1; [L49] double var_1_33 = 3.2; [L50] unsigned char var_1_34 = 2; [L51] unsigned char var_1_35 = 4; [L52] signed long int var_1_36 = -256; [L53] unsigned short int var_1_37 = 64; [L54] unsigned short int var_1_38 = 16; [L55] unsigned short int last_1_var_1_6 = 4; [L56] unsigned short int last_1_var_1_9 = 4; [L57] unsigned long int last_1_var_1_14 = 500; [L58] signed short int last_1_var_1_17 = 16; VAL [isInitial=0, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L190] isInitial = 1 [L191] FCALL initially() [L192] COND TRUE 1 [L193] CALL updateLastVariables() [L180] last_1_var_1_6 = var_1_6 [L181] last_1_var_1_9 = var_1_9 [L182] last_1_var_1_14 = var_1_14 [L183] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L193] RET updateLastVariables() [L194] CALL updateVariables() [L126] var_1_4 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_5=0, var_1_6=4, var_1_9=4] [L127] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_5=0, var_1_6=4, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L128] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L129] var_1_5 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_6=4, var_1_9=4] [L130] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_6=4, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L131] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L132] var_1_10 = __VERIFIER_nondet_ushort() [L133] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L133] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L135] var_1_12 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L136] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L137] var_1_13 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_13 >= 0.0F && 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=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L138] RET assume_abort_if_not((var_1_13 >= 0.0F && 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=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L139] var_1_15 = __VERIFIER_nondet_ulong() [L140] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L140] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L141] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L141] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L142] var_1_16 = __VERIFIER_nondet_ulong() [L143] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L143] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L144] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L144] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L145] var_1_19 = __VERIFIER_nondet_short() [L146] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L146] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L148] var_1_20 = __VERIFIER_nondet_short() [L149] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L149] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L151] var_1_21 = __VERIFIER_nondet_short() [L152] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L154] var_1_22 = __VERIFIER_nondet_short() [L155] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L157] var_1_24 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_24 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] RET assume_abort_if_not(var_1_24 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L159] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L159] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L160] var_1_27 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L161] RET assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L162] var_1_28 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L163] RET assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L164] var_1_29 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_29 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L165] RET assume_abort_if_not(var_1_29 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L166] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L166] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L167] var_1_31 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L168] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L169] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L169] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L170] var_1_32 = __VERIFIER_nondet_ushort() [L171] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L171] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L172] CALL assume_abort_if_not(var_1_32 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L172] RET assume_abort_if_not(var_1_32 <= 65535) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L173] var_1_33 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L174] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L175] var_1_35 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L176] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L177] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L177] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L194] RET updateVariables() [L195] CALL step() [L62] var_1_23 = var_1_24 [L63] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L64] COND TRUE (- var_1_27) >= var_1_28 [L65] var_1_26 = ((((var_1_24) > (var_1_29)) ? (var_1_24) : (var_1_29))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L67] COND FALSE !(\read(var_1_31)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L72] COND FALSE !(var_1_26 < var_1_24) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L75] COND TRUE var_1_34 != ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))) [L76] var_1_36 = (((((var_1_34 - var_1_32)) < ((((((var_1_24 + var_1_26)) < (var_1_25)) ? ((var_1_24 + var_1_26)) : (var_1_25))))) ? ((var_1_34 - var_1_32)) : ((((((var_1_24 + var_1_26)) < (var_1_25)) ? ((var_1_24 + var_1_26)) : (var_1_25)))))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L78] var_1_37 = var_1_34 [L79] var_1_38 = var_1_35 [L80] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L81] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L86] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L87] COND TRUE last_1_var_1_14 >= stepLocal_3 [L88] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L90] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L91] COND TRUE (- var_1_14) > var_1_6 [L92] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L97] unsigned char stepLocal_2 = var_1_4; [L98] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225454, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L99] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225454, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L102] COND TRUE stepLocal_1 >= var_1_6 [L103] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L108] unsigned char stepLocal_5 = var_1_1; [L109] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L110] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L117] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L118] COND TRUE ! var_1_1 [L119] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L195] RET step() [L196] CALL, EXPR property() [L186-L187] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L196] RET, EXPR property() [L196] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.5s, OverallIterations: 11, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2002 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1998 mSDsluCounter, 4483 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2892 mSDsCounter, 796 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3113 IncrementalHoareTripleChecker+Invalid, 3909 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 796 mSolverCounterUnsat, 1591 mSDtfsCounter, 3113 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2097 GetRequests, 1925 SyntacticMatches, 4 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3907 ImplicationChecksByTransitivity, 20.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=980occurred in iteration=7, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 1022 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 35.6s InterpolantComputationTime, 3161 NumberOfCodeBlocks, 3161 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3144 ConstructedInterpolants, 0 QuantifiedInterpolants, 16776 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1473 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 30528/31680 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-16 13:20:43,028 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-4.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 cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:20:45,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:20:45,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 13:20:45,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:20:45,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:20:45,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:20:45,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:20:45,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:20:45,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:20:45,335 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:20:45,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:20:45,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:20:45,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:20:45,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:20:45,336 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:20:45,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:20:45,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:20:45,337 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:20:45,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:20:45,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:20:45,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:20:45,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:20:45,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:20:45,340 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 13:20:45,340 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 13:20:45,340 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:20:45,340 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 13:20:45,341 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:20:45,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:20:45,341 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:20:45,341 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:20:45,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:20:45,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:20:45,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:20:45,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:20:45,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:20:45,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:20:45,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:20:45,344 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 13:20:45,344 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 13:20:45,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:20:45,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:20:45,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:20:45,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:20:45,346 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 -> cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 [2024-11-16 13:20:45,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:20:45,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:20:45,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:20:45,726 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:20:45,726 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:20:45,728 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-4.i [2024-11-16 13:20:47,323 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:20:47,580 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:20:47,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-16 13:20:47,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5854640/9d557fee94544ab0935038650cc1cc26/FLAG2a558c44d [2024-11-16 13:20:47,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5854640/9d557fee94544ab0935038650cc1cc26 [2024-11-16 13:20:47,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:20:47,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:20:47,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:20:47,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:20:47,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:20:47,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:20:47" (1/1) ... [2024-11-16 13:20:47,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fed0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:20:47, skipping insertion in model container [2024-11-16 13:20:47,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:20:47" (1/1) ... [2024-11-16 13:20:47,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:20:47,879 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-4.i[914,927] [2024-11-16 13:20:47,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:20:47,993 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:20:48,006 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-4.i[914,927] [2024-11-16 13:20:48,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:20:48,056 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:20:48,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:20:48 WrapperNode [2024-11-16 13:20:48,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:20:48,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:20:48,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:20:48,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:20:48,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:20:48" (1/1) ... [2024-11-16 13:20:48,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:20:48" (1/1) ... [2024-11-16 13:20:48,119 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-11-16 13:20:48,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:20:48,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:20:48,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:20:48,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:20:48,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:20:48" (1/1) ... [2024-11-16 13:20:48,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:20:48" (1/1) ... [2024-11-16 13:20:48,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:20:48" (1/1) ... [2024-11-16 13:20:48,156 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-16 13:20:48,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:20:48" (1/1) ... [2024-11-16 13:20:48,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:20:48" (1/1) ... [2024-11-16 13:20:48,166 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:20:48" (1/1) ... [2024-11-16 13:20:48,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:20:48" (1/1) ... [2024-11-16 13:20:48,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:20:48" (1/1) ... [2024-11-16 13:20:48,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:20:48" (1/1) ... [2024-11-16 13:20:48,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:20:48,176 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:20:48,176 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:20:48,177 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:20:48,177 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:20:48" (1/1) ... [2024-11-16 13:20:48,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:20:48,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:20:48,233 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-16 13:20:48,236 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-16 13:20:48,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:20:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 13:20:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:20:48,283 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:20:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:20:48,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:20:48,392 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:20:48,398 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:20:49,121 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-16 13:20:49,122 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:20:49,136 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:20:49,137 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:20:49,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:20:49 BoogieIcfgContainer [2024-11-16 13:20:49,137 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:20:49,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:20:49,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:20:49,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:20:49,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:20:47" (1/3) ... [2024-11-16 13:20:49,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac29487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:20:49, skipping insertion in model container [2024-11-16 13:20:49,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:20:48" (2/3) ... [2024-11-16 13:20:49,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac29487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:20:49, skipping insertion in model container [2024-11-16 13:20:49,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:20:49" (3/3) ... [2024-11-16 13:20:49,147 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-16 13:20:49,165 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:20:49,166 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:20:49,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:20:49,272 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;@70044e6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:20:49,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:20:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 59 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-16 13:20:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-16 13:20:49,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:20:49,296 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:20:49,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:20:49,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:20:49,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1471072572, now seen corresponding path program 1 times [2024-11-16 13:20:49,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:20:49,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809211847] [2024-11-16 13:20:49,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:49,315 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-16 13:20:49,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:20:49,318 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-16 13:20:49,337 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-16 13:20:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:49,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 13:20:49,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:20:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 1508 trivial. 0 not checked. [2024-11-16 13:20:49,758 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:20:49,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:20:49,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809211847] [2024-11-16 13:20:49,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809211847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:20:49,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:20:49,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:20:49,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183536440] [2024-11-16 13:20:49,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:20:49,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:20:49,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:20:49,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:20:49,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:20:49,806 INFO L87 Difference]: Start difference. First operand has 94 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 59 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-16 13:20:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:20:49,852 INFO L93 Difference]: Finished difference Result 180 states and 316 transitions. [2024-11-16 13:20:49,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:20:49,854 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 209 [2024-11-16 13:20:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:20:49,861 INFO L225 Difference]: With dead ends: 180 [2024-11-16 13:20:49,861 INFO L226 Difference]: Without dead ends: 89 [2024-11-16 13:20:49,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 208 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-16 13:20:49,868 INFO L432 NwaCegarLoop]: 136 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, 136 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-16 13:20:49,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:20:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-16 13:20:49,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-16 13:20:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-16 13:20:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 136 transitions. [2024-11-16 13:20:49,913 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 136 transitions. Word has length 209 [2024-11-16 13:20:49,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:20:49,914 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 136 transitions. [2024-11-16 13:20:49,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-16 13:20:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 136 transitions. [2024-11-16 13:20:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-16 13:20:49,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:20:49,920 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:20:49,929 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-16 13:20:50,120 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-16 13:20:50,121 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:20:50,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:20:50,122 INFO L85 PathProgramCache]: Analyzing trace with hash 601280196, now seen corresponding path program 1 times [2024-11-16 13:20:50,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:20:50,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941974663] [2024-11-16 13:20:50,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:50,123 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-16 13:20:50,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:20:50,127 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-16 13:20:50,129 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-16 13:20:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:50,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 13:20:50,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:20:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 13:20:50,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:20:50,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:20:50,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941974663] [2024-11-16 13:20:50,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941974663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:20:50,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:20:50,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:20:50,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310287015] [2024-11-16 13:20:50,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:20:50,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:20:50,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:20:50,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:20:50,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:20:50,502 INFO L87 Difference]: Start difference. First operand 89 states and 136 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 13:20:50,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:20:50,590 INFO L93 Difference]: Finished difference Result 254 states and 389 transitions. [2024-11-16 13:20:50,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:20:50,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-11-16 13:20:50,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:20:50,596 INFO L225 Difference]: With dead ends: 254 [2024-11-16 13:20:50,596 INFO L226 Difference]: Without dead ends: 168 [2024-11-16 13:20:50,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 208 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-16 13:20:50,600 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 118 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:20:50,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 348 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:20:50,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-16 13:20:50,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2024-11-16 13:20:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 97 states have (on average 1.2783505154639174) internal successors, (124), 98 states have internal predecessors, (124), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-16 13:20:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 252 transitions. [2024-11-16 13:20:50,639 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 252 transitions. Word has length 210 [2024-11-16 13:20:50,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:20:50,641 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 252 transitions. [2024-11-16 13:20:50,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 13:20:50,641 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 252 transitions. [2024-11-16 13:20:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-16 13:20:50,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:20:50,649 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:20:50,661 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-16 13:20:50,849 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-16 13:20:50,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:20:50,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:20:50,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1954589893, now seen corresponding path program 1 times [2024-11-16 13:20:50,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:20:50,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095662976] [2024-11-16 13:20:50,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:50,852 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-16 13:20:50,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:20:50,853 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-16 13:20:50,854 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-16 13:20:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:51,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 13:20:51,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:20:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 309 proven. 177 refuted. 0 times theorem prover too weak. 1626 trivial. 0 not checked. [2024-11-16 13:20:52,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:20:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 180 refuted. 0 times theorem prover too weak. 1923 trivial. 0 not checked. [2024-11-16 13:20:53,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:20:53,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095662976] [2024-11-16 13:20:53,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095662976] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:20:53,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 13:20:53,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-16 13:20:53,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726371717] [2024-11-16 13:20:53,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 13:20:53,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 13:20:53,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:20:53,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 13:20:53,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-16 13:20:53,276 INFO L87 Difference]: Start difference. First operand 164 states and 252 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2024-11-16 13:20:55,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:20:55,012 INFO L93 Difference]: Finished difference Result 378 states and 553 transitions. [2024-11-16 13:20:55,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 13:20:55,014 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) Word has length 210 [2024-11-16 13:20:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:20:55,022 INFO L225 Difference]: With dead ends: 378 [2024-11-16 13:20:55,025 INFO L226 Difference]: Without dead ends: 217 [2024-11-16 13:20:55,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 405 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-11-16 13:20:55,032 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 69 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 13:20:55,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 431 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 13:20:55,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-16 13:20:55,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 188. [2024-11-16 13:20:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 117 states have (on average 1.1623931623931625) internal successors, (136), 118 states have internal predecessors, (136), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-16 13:20:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2024-11-16 13:20:55,074 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 210 [2024-11-16 13:20:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:20:55,077 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2024-11-16 13:20:55,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2024-11-16 13:20:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2024-11-16 13:20:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-16 13:20:55,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:20:55,081 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:20:55,092 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-16 13:20:55,281 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-16 13:20:55,282 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:20:55,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:20:55,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1759269150, now seen corresponding path program 1 times [2024-11-16 13:20:55,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:20:55,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794879230] [2024-11-16 13:20:55,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:55,284 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-16 13:20:55,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:20:55,287 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-16 13:20:55,290 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-16 13:20:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:55,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 13:20:55,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:20:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 13:20:56,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:20:56,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:20:56,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794879230] [2024-11-16 13:20:56,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794879230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:20:56,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:20:56,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:20:56,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583107242] [2024-11-16 13:20:56,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:20:56,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:20:56,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:20:56,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:20:56,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:20:56,112 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 13:20:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:20:57,295 INFO L93 Difference]: Finished difference Result 544 states and 766 transitions. [2024-11-16 13:20:57,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 13:20:57,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2024-11-16 13:20:57,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:20:57,302 INFO L225 Difference]: With dead ends: 544 [2024-11-16 13:20:57,302 INFO L226 Difference]: Without dead ends: 359 [2024-11-16 13:20:57,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-16 13:20:57,304 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 158 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:20:57,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 367 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 13:20:57,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-16 13:20:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2024-11-16 13:20:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 215 states have (on average 1.130232558139535) internal successors, (243), 217 states have internal predecessors, (243), 128 states have call successors, (128), 12 states have call predecessors, (128), 12 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-16 13:20:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 499 transitions. [2024-11-16 13:20:57,373 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 499 transitions. Word has length 211 [2024-11-16 13:20:57,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:20:57,374 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 499 transitions. [2024-11-16 13:20:57,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 13:20:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 499 transitions. [2024-11-16 13:20:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-16 13:20:57,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:20:57,376 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:20:57,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-16 13:20:57,577 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-16 13:20:57,577 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:20:57,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:20:57,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1955782655, now seen corresponding path program 1 times [2024-11-16 13:20:57,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:20:57,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710764981] [2024-11-16 13:20:57,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:57,579 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-16 13:20:57,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:20:57,582 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-16 13:20:57,584 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-16 13:20:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:57,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 13:20:57,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:20:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 816 proven. 72 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2024-11-16 13:20:59,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:20:59,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:20:59,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710764981] [2024-11-16 13:20:59,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710764981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:20:59,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [547350507] [2024-11-16 13:20:59,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:59,664 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 13:20:59,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 13:20:59,667 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 13:20:59,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-16 13:21:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:00,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 13:21:00,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:21:02,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 932 proven. 135 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2024-11-16 13:21:02,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:21:02,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [547350507] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:21:02,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 13:21:02,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-11-16 13:21:02,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396589252] [2024-11-16 13:21:02,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 13:21:02,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 13:21:02,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:21:02,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 13:21:02,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-16 13:21:02,529 INFO L87 Difference]: Start difference. First operand 356 states and 499 transitions. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 16 states have internal predecessors, (104), 5 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66)