./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-35.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 7206887450f4a9b0c4891eb37a14ba6cf6f69a3dc055684f3fcebb9c7410f059 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:30:28,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:30:28,798 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:30:28,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:30:28,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:30:28,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:30:28,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:30:28,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:30:28,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:30:28,827 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:30:28,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:30:28,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:30:28,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:30:28,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:30:28,830 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:30:28,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:30:28,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:30:28,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:30:28,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:30:28,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:30:28,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:30:28,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:30:28,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:30:28,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:30:28,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:30:28,833 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:30:28,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:30:28,833 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:30:28,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:30:28,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:30:28,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:30:28,834 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:30:28,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:30:28,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:30:28,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:30:28,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:30:28,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:30:28,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:30:28,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:30:28,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:30:28,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:30:28,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:30:28,838 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 -> 7206887450f4a9b0c4891eb37a14ba6cf6f69a3dc055684f3fcebb9c7410f059 [2024-10-13 02:30:29,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:30:29,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:30:29,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:30:29,061 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:30:29,061 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:30:29,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-35.i [2024-10-13 02:30:30,249 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:30:30,429 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:30:30,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-35.i [2024-10-13 02:30:30,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a28c2e4e/87e97c16d585468494501921a9a557df/FLAG11f481b2f [2024-10-13 02:30:30,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a28c2e4e/87e97c16d585468494501921a9a557df [2024-10-13 02:30:30,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:30:30,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:30:30,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:30:30,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:30:30,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:30:30,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:30:30" (1/1) ... [2024-10-13 02:30:30,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dab7030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:30, skipping insertion in model container [2024-10-13 02:30:30,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:30:30" (1/1) ... [2024-10-13 02:30:30,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:30:30,637 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-35.i[919,932] [2024-10-13 02:30:30,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:30:30,726 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:30:30,737 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-35.i[919,932] [2024-10-13 02:30:30,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:30:30,789 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:30:30,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:30 WrapperNode [2024-10-13 02:30:30,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:30:30,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:30:30,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:30:30,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:30:30,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:30" (1/1) ... [2024-10-13 02:30:30,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:30" (1/1) ... [2024-10-13 02:30:30,835 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 260 [2024-10-13 02:30:30,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:30:30,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:30:30,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:30:30,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:30:30,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:30" (1/1) ... [2024-10-13 02:30:30,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:30" (1/1) ... [2024-10-13 02:30:30,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:30" (1/1) ... [2024-10-13 02:30:30,875 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:30:30,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:30" (1/1) ... [2024-10-13 02:30:30,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:30" (1/1) ... [2024-10-13 02:30:30,883 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:30" (1/1) ... [2024-10-13 02:30:30,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:30" (1/1) ... [2024-10-13 02:30:30,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:30" (1/1) ... [2024-10-13 02:30:30,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:30" (1/1) ... [2024-10-13 02:30:30,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:30:30,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:30:30,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:30:30,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:30:30,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:30" (1/1) ... [2024-10-13 02:30:30,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:30:30,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:30:30,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:30:30,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:30:30,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:30:30,966 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:30:30,967 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:30:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:30:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:30:30,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:30:31,042 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:30:31,044 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:30:31,412 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 02:30:31,412 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:30:31,448 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:30:31,449 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:30:31,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:30:31 BoogieIcfgContainer [2024-10-13 02:30:31,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:30:31,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:30:31,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:30:31,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:30:31,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:30:30" (1/3) ... [2024-10-13 02:30:31,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5e344d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:30:31, skipping insertion in model container [2024-10-13 02:30:31,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:30" (2/3) ... [2024-10-13 02:30:31,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5e344d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:30:31, skipping insertion in model container [2024-10-13 02:30:31,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:30:31" (3/3) ... [2024-10-13 02:30:31,459 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-35.i [2024-10-13 02:30:31,471 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:30:31,471 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:30:31,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:30:31,537 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;@60efe66c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:30:31,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:30:31,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 02:30:31,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-13 02:30:31,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:31,559 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:31,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:31,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:31,566 INFO L85 PathProgramCache]: Analyzing trace with hash -608588209, now seen corresponding path program 1 times [2024-10-13 02:30:31,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:31,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889488365] [2024-10-13 02:30:31,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:30:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:30:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:30:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:30:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:30:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:30:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:30:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:30:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:30:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:30:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:30:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:30:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:30:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 02:30:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:30:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 02:30:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:30:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:30:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:30:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:30:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 02:30:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 02:30:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-13 02:30:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-13 02:30:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 02:30:32,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:32,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889488365] [2024-10-13 02:30:32,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889488365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:32,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:32,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:30:32,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095850749] [2024-10-13 02:30:32,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:32,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:30:32,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:32,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:30:32,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:30:32,113 INFO L87 Difference]: Start difference. First operand has 102 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 02:30:32,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:32,149 INFO L93 Difference]: Finished difference Result 200 states and 348 transitions. [2024-10-13 02:30:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:30:32,151 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 208 [2024-10-13 02:30:32,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:32,157 INFO L225 Difference]: With dead ends: 200 [2024-10-13 02:30:32,158 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 02:30:32,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:30:32,165 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:32,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:30:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 02:30:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-13 02:30:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 02:30:32,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 152 transitions. [2024-10-13 02:30:32,206 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 152 transitions. Word has length 208 [2024-10-13 02:30:32,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:32,208 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 152 transitions. [2024-10-13 02:30:32,208 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 02:30:32,208 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 152 transitions. [2024-10-13 02:30:32,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-13 02:30:32,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:32,212 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:32,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:30:32,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:32,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:32,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1758895545, now seen corresponding path program 1 times [2024-10-13 02:30:32,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:32,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416697265] [2024-10-13 02:30:32,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:32,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:30:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:30:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:30:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:30:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:30:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:30:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:30:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:30:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:30:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:30:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:30:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:30:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:30:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 02:30:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:30:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 02:30:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:30:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:30:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:30:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:30:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 02:30:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 02:30:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-13 02:30:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-13 02:30:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 02:30:32,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:32,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416697265] [2024-10-13 02:30:32,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416697265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:32,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:32,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:30:32,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112121113] [2024-10-13 02:30:32,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:32,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:30:32,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:32,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:30:32,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:30:32,713 INFO L87 Difference]: Start difference. First operand 99 states and 152 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:32,971 INFO L93 Difference]: Finished difference Result 329 states and 505 transitions. [2024-10-13 02:30:32,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:30:32,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-10-13 02:30:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:32,976 INFO L225 Difference]: With dead ends: 329 [2024-10-13 02:30:32,976 INFO L226 Difference]: Without dead ends: 231 [2024-10-13 02:30:32,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:30:32,978 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 146 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:32,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 593 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:30:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-13 02:30:33,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 195. [2024-10-13 02:30:33,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 128 states have (on average 1.3515625) internal successors, (173), 128 states have internal predecessors, (173), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 02:30:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 301 transitions. [2024-10-13 02:30:33,020 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 301 transitions. Word has length 208 [2024-10-13 02:30:33,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:33,021 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 301 transitions. [2024-10-13 02:30:33,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:33,023 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 301 transitions. [2024-10-13 02:30:33,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-13 02:30:33,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:33,026 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:33,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:30:33,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:33,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:33,028 INFO L85 PathProgramCache]: Analyzing trace with hash 53748691, now seen corresponding path program 1 times [2024-10-13 02:30:33,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:33,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425245882] [2024-10-13 02:30:33,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:33,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:30:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:30:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:30:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:30:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:30:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:30:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:30:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:30:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:30:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:30:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:30:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:30:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:30:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 02:30:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:30:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 02:30:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:30:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:30:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:30:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:30:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 02:30:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 02:30:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-13 02:30:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-13 02:30:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 02:30:33,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:33,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425245882] [2024-10-13 02:30:33,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425245882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:33,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:33,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:30:33,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561738223] [2024-10-13 02:30:33,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:33,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:30:33,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:33,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:30:33,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:30:33,342 INFO L87 Difference]: Start difference. First operand 195 states and 301 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 02:30:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:33,588 INFO L93 Difference]: Finished difference Result 585 states and 905 transitions. [2024-10-13 02:30:33,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:30:33,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 209 [2024-10-13 02:30:33,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:33,595 INFO L225 Difference]: With dead ends: 585 [2024-10-13 02:30:33,595 INFO L226 Difference]: Without dead ends: 391 [2024-10-13 02:30:33,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:30:33,599 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 134 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:33,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 472 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:30:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-13 02:30:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2024-10-13 02:30:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 256 states have (on average 1.3359375) internal successors, (342), 256 states have internal predecessors, (342), 128 states have call successors, (128), 4 states have call predecessors, (128), 4 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2024-10-13 02:30:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 598 transitions. [2024-10-13 02:30:33,668 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 598 transitions. Word has length 209 [2024-10-13 02:30:33,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:33,670 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 598 transitions. [2024-10-13 02:30:33,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 02:30:33,671 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 598 transitions. [2024-10-13 02:30:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-13 02:30:33,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:33,674 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:33,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:30:33,675 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:33,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:33,675 INFO L85 PathProgramCache]: Analyzing trace with hash 754813269, now seen corresponding path program 1 times [2024-10-13 02:30:33,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:33,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86545101] [2024-10-13 02:30:33,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:33,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:30:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:30:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:30:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:30:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:30:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:30:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:30:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:30:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:30:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:30:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:30:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:30:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:30:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 02:30:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:30:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 02:30:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:30:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:30:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:30:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:30:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 02:30:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 02:30:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-13 02:30:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-13 02:30:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 02:30:34,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:34,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86545101] [2024-10-13 02:30:34,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86545101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:34,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:34,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:30:34,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838466407] [2024-10-13 02:30:34,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:34,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:30:34,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:34,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:30:34,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:30:34,049 INFO L87 Difference]: Start difference. First operand 389 states and 598 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:34,130 INFO L93 Difference]: Finished difference Result 1165 states and 1792 transitions. [2024-10-13 02:30:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:30:34,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2024-10-13 02:30:34,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:34,136 INFO L225 Difference]: With dead ends: 1165 [2024-10-13 02:30:34,136 INFO L226 Difference]: Without dead ends: 777 [2024-10-13 02:30:34,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:30:34,139 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 84 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:34,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 325 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:30:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-10-13 02:30:34,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 775. [2024-10-13 02:30:34,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 510 states have (on average 1.3215686274509804) internal successors, (674), 510 states have internal predecessors, (674), 256 states have call successors, (256), 8 states have call predecessors, (256), 8 states have return successors, (256), 256 states have call predecessors, (256), 256 states have call successors, (256) [2024-10-13 02:30:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1186 transitions. [2024-10-13 02:30:34,229 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1186 transitions. Word has length 209 [2024-10-13 02:30:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:34,229 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1186 transitions. [2024-10-13 02:30:34,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1186 transitions. [2024-10-13 02:30:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-13 02:30:34,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:34,232 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:34,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:30:34,232 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:34,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:34,232 INFO L85 PathProgramCache]: Analyzing trace with hash -427886380, now seen corresponding path program 1 times [2024-10-13 02:30:34,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:34,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328438682] [2024-10-13 02:30:34,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:34,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:30:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:30:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:30:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:30:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:30:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:30:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:30:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:30:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:30:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:30:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:30:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:30:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:30:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 02:30:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:30:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 02:30:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:30:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:30:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:30:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:30:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 02:30:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 02:30:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-13 02:30:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-13 02:30:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 02:30:34,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:34,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328438682] [2024-10-13 02:30:34,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328438682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:34,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:34,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:30:34,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084889417] [2024-10-13 02:30:34,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:34,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:30:34,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:34,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:30:34,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:30:34,492 INFO L87 Difference]: Start difference. First operand 775 states and 1186 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:34,761 INFO L93 Difference]: Finished difference Result 2685 states and 4089 transitions. [2024-10-13 02:30:34,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:30:34,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 210 [2024-10-13 02:30:34,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:34,770 INFO L225 Difference]: With dead ends: 2685 [2024-10-13 02:30:34,770 INFO L226 Difference]: Without dead ends: 1911 [2024-10-13 02:30:34,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:30:34,773 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 215 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:34,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 469 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:30:34,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2024-10-13 02:30:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1363. [2024-10-13 02:30:34,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1034 states have (on average 1.390715667311412) internal successors, (1438), 1042 states have internal predecessors, (1438), 312 states have call successors, (312), 16 states have call predecessors, (312), 16 states have return successors, (312), 304 states have call predecessors, (312), 312 states have call successors, (312) [2024-10-13 02:30:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2062 transitions. [2024-10-13 02:30:34,909 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2062 transitions. Word has length 210 [2024-10-13 02:30:34,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:34,909 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 2062 transitions. [2024-10-13 02:30:34,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:34,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2062 transitions. [2024-10-13 02:30:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-13 02:30:34,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:34,911 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:34,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:30:34,912 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:34,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:34,914 INFO L85 PathProgramCache]: Analyzing trace with hash -5184554, now seen corresponding path program 1 times [2024-10-13 02:30:34,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:34,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163634337] [2024-10-13 02:30:34,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:34,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:30:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:30:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:30:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:30:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:30:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:30:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:30:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:30:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:30:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:30:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:30:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:30:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:30:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 02:30:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:30:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 02:30:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:30:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:30:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:30:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:30:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 02:30:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 02:30:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-13 02:30:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-13 02:30:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 02:30:35,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:35,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163634337] [2024-10-13 02:30:35,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163634337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:35,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:35,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:30:35,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263719048] [2024-10-13 02:30:35,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:35,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:30:35,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:35,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:30:35,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:30:35,266 INFO L87 Difference]: Start difference. First operand 1363 states and 2062 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 02:30:35,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:35,692 INFO L93 Difference]: Finished difference Result 2997 states and 4533 transitions. [2024-10-13 02:30:35,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:30:35,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 210 [2024-10-13 02:30:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:35,702 INFO L225 Difference]: With dead ends: 2997 [2024-10-13 02:30:35,702 INFO L226 Difference]: Without dead ends: 1635 [2024-10-13 02:30:35,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 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-10-13 02:30:35,707 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 248 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:35,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 581 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:30:35,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2024-10-13 02:30:35,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1363. [2024-10-13 02:30:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1034 states have (on average 1.3829787234042554) internal successors, (1430), 1042 states have internal predecessors, (1430), 312 states have call successors, (312), 16 states have call predecessors, (312), 16 states have return successors, (312), 304 states have call predecessors, (312), 312 states have call successors, (312) [2024-10-13 02:30:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2054 transitions. [2024-10-13 02:30:35,840 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2054 transitions. Word has length 210 [2024-10-13 02:30:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:35,841 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 2054 transitions. [2024-10-13 02:30:35,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 02:30:35,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2054 transitions. [2024-10-13 02:30:35,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-13 02:30:35,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:35,843 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:35,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 02:30:35,844 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:35,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:35,844 INFO L85 PathProgramCache]: Analyzing trace with hash 52073748, now seen corresponding path program 1 times [2024-10-13 02:30:35,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:35,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994140140] [2024-10-13 02:30:35,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:35,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:30:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:30:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:30:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:30:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:30:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:30:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:30:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:30:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:30:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:30:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:30:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:30:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:30:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 02:30:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:30:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 02:30:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:30:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:30:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:30:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:30:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 02:30:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 02:30:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-13 02:30:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-13 02:30:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 02:30:36,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:36,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994140140] [2024-10-13 02:30:36,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994140140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:36,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:36,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:30:36,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145387550] [2024-10-13 02:30:36,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:36,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:30:36,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:36,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:30:36,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:30:36,272 INFO L87 Difference]: Start difference. First operand 1363 states and 2054 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:36,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:36,583 INFO L93 Difference]: Finished difference Result 3111 states and 4669 transitions. [2024-10-13 02:30:36,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:30:36,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 210 [2024-10-13 02:30:36,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:36,592 INFO L225 Difference]: With dead ends: 3111 [2024-10-13 02:30:36,592 INFO L226 Difference]: Without dead ends: 1749 [2024-10-13 02:30:36,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:30:36,596 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 252 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:36,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 489 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:30:36,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2024-10-13 02:30:36,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1553. [2024-10-13 02:30:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1224 states have (on average 1.4003267973856208) internal successors, (1714), 1232 states have internal predecessors, (1714), 312 states have call successors, (312), 16 states have call predecessors, (312), 16 states have return successors, (312), 304 states have call predecessors, (312), 312 states have call successors, (312) [2024-10-13 02:30:36,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 2338 transitions. [2024-10-13 02:30:36,724 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 2338 transitions. Word has length 210 [2024-10-13 02:30:36,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:36,725 INFO L471 AbstractCegarLoop]: Abstraction has 1553 states and 2338 transitions. [2024-10-13 02:30:36,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 2338 transitions. [2024-10-13 02:30:36,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-13 02:30:36,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:36,728 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:36,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 02:30:36,728 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:36,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:36,729 INFO L85 PathProgramCache]: Analyzing trace with hash -9965866, now seen corresponding path program 1 times [2024-10-13 02:30:36,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:36,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301242862] [2024-10-13 02:30:36,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:36,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:30:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:30:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:30:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:30:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:30:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:30:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:30:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:30:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:30:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:30:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:30:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:30:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:30:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 02:30:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:30:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 02:30:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:30:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:36,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:30:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:30:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:30:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 02:30:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 02:30:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-13 02:30:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-13 02:30:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 02:30:37,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:37,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301242862] [2024-10-13 02:30:37,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301242862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:37,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:37,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:30:37,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957681902] [2024-10-13 02:30:37,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:37,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:30:37,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:37,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:30:37,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:30:37,019 INFO L87 Difference]: Start difference. First operand 1553 states and 2338 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:37,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:37,250 INFO L93 Difference]: Finished difference Result 3415 states and 5133 transitions. [2024-10-13 02:30:37,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:30:37,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 210 [2024-10-13 02:30:37,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:37,259 INFO L225 Difference]: With dead ends: 3415 [2024-10-13 02:30:37,260 INFO L226 Difference]: Without dead ends: 1863 [2024-10-13 02:30:37,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:30:37,264 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 146 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:37,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 474 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:30:37,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2024-10-13 02:30:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1553. [2024-10-13 02:30:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1224 states have (on average 1.3970588235294117) internal successors, (1710), 1232 states have internal predecessors, (1710), 312 states have call successors, (312), 16 states have call predecessors, (312), 16 states have return successors, (312), 304 states have call predecessors, (312), 312 states have call successors, (312) [2024-10-13 02:30:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 2334 transitions. [2024-10-13 02:30:37,422 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 2334 transitions. Word has length 210 [2024-10-13 02:30:37,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:37,423 INFO L471 AbstractCegarLoop]: Abstraction has 1553 states and 2334 transitions. [2024-10-13 02:30:37,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 2334 transitions. [2024-10-13 02:30:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-13 02:30:37,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:37,426 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:37,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 02:30:37,426 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:37,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:37,427 INFO L85 PathProgramCache]: Analyzing trace with hash -519438956, now seen corresponding path program 1 times [2024-10-13 02:30:37,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:37,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877618312] [2024-10-13 02:30:37,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:37,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:30:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:30:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:30:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:30:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:30:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:30:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:30:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:30:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:30:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:30:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:30:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:30:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:30:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 02:30:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:30:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 02:30:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:30:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:30:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:30:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:30:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 02:30:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 02:30:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-13 02:30:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-13 02:30:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 02:30:37,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877618312] [2024-10-13 02:30:37,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877618312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:37,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:37,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:30:37,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194102779] [2024-10-13 02:30:37,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:37,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:30:37,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:37,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:30:37,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:30:37,725 INFO L87 Difference]: Start difference. First operand 1553 states and 2334 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:38,028 INFO L93 Difference]: Finished difference Result 2662 states and 3963 transitions. [2024-10-13 02:30:38,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:30:38,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 210 [2024-10-13 02:30:38,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:38,037 INFO L225 Difference]: With dead ends: 2662 [2024-10-13 02:30:38,038 INFO L226 Difference]: Without dead ends: 1885 [2024-10-13 02:30:38,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 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-10-13 02:30:38,040 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 133 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:38,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 560 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:30:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2024-10-13 02:30:38,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1553. [2024-10-13 02:30:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1224 states have (on average 1.3872549019607843) internal successors, (1698), 1232 states have internal predecessors, (1698), 312 states have call successors, (312), 16 states have call predecessors, (312), 16 states have return successors, (312), 304 states have call predecessors, (312), 312 states have call successors, (312) [2024-10-13 02:30:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 2322 transitions. [2024-10-13 02:30:38,199 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 2322 transitions. Word has length 210 [2024-10-13 02:30:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:38,200 INFO L471 AbstractCegarLoop]: Abstraction has 1553 states and 2322 transitions. [2024-10-13 02:30:38,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 2322 transitions. [2024-10-13 02:30:38,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-13 02:30:38,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:38,202 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:38,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 02:30:38,203 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:38,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1530556206, now seen corresponding path program 1 times [2024-10-13 02:30:38,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:38,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7500243] [2024-10-13 02:30:38,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:30:38,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [484848342] [2024-10-13 02:30:38,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:38,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:30:38,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:30:38,260 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:30:38,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 02:30:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:30:38,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:30:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:30:38,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:30:38,578 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:30:38,578 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:30:38,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 02:30:38,783 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,SelfDestructingSolverStorable9 [2024-10-13 02:30:38,787 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:38,912 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:30:38,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:30:38 BoogieIcfgContainer [2024-10-13 02:30:38,916 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:30:38,916 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:30:38,916 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:30:38,916 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:30:38,917 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:30:31" (3/4) ... [2024-10-13 02:30:38,918 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:30:38,919 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:30:38,919 INFO L158 Benchmark]: Toolchain (without parser) took 8465.70ms. Allocated memory was 209.7MB in the beginning and 469.8MB in the end (delta: 260.0MB). Free memory was 176.5MB in the beginning and 245.0MB in the end (delta: -68.6MB). Peak memory consumption was 191.8MB. Max. memory is 16.1GB. [2024-10-13 02:30:38,920 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory was 92.1MB in the beginning and 92.0MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:30:38,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.29ms. Allocated memory is still 209.7MB. Free memory was 176.2MB in the beginning and 163.8MB in the end (delta: 12.5MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-10-13 02:30:38,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.95ms. Allocated memory is still 209.7MB. Free memory was 163.8MB in the beginning and 159.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:30:38,920 INFO L158 Benchmark]: Boogie Preprocessor took 62.80ms. Allocated memory is still 209.7MB. Free memory was 159.6MB in the beginning and 155.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:30:38,921 INFO L158 Benchmark]: RCFGBuilder took 549.42ms. Allocated memory is still 209.7MB. Free memory was 155.4MB in the beginning and 122.9MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 02:30:38,921 INFO L158 Benchmark]: TraceAbstraction took 7464.85ms. Allocated memory was 209.7MB in the beginning and 469.8MB in the end (delta: 260.0MB). Free memory was 121.8MB in the beginning and 245.0MB in the end (delta: -123.2MB). Peak memory consumption was 136.5MB. Max. memory is 16.1GB. [2024-10-13 02:30:38,921 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 469.8MB. Free memory is still 245.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:30:38,923 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 130.0MB. Free memory was 92.1MB in the beginning and 92.0MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.29ms. Allocated memory is still 209.7MB. Free memory was 176.2MB in the beginning and 163.8MB in the end (delta: 12.5MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.95ms. Allocated memory is still 209.7MB. Free memory was 163.8MB in the beginning and 159.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.80ms. Allocated memory is still 209.7MB. Free memory was 159.6MB in the beginning and 155.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 549.42ms. Allocated memory is still 209.7MB. Free memory was 155.4MB in the beginning and 122.9MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7464.85ms. Allocated memory was 209.7MB in the beginning and 469.8MB in the end (delta: 260.0MB). Free memory was 121.8MB in the beginning and 245.0MB in the end (delta: -123.2MB). Peak memory consumption was 136.5MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 469.8MB. Free memory is still 245.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of someBinaryDOUBLEComparisonOperation at line 201, overapproximation of someUnaryFLOAToperation at line 131, overapproximation of someBinaryArithmeticFLOAToperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_3 = 1; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 0; [L26] unsigned short int var_1_6 = 25; [L27] double var_1_9 = 999.625; [L28] unsigned short int var_1_11 = 5; [L29] signed short int var_1_12 = 2; [L30] signed long int var_1_13 = -256; [L31] double var_1_14 = 127.75; [L32] double var_1_15 = 9.75; [L33] float var_1_16 = 32.8; [L34] float var_1_17 = 32.5; [L35] float var_1_18 = 1.75; [L36] float var_1_19 = 1000000000000000.4; [L37] float var_1_20 = 0.875; [L38] unsigned char var_1_21 = 0; [L39] unsigned char var_1_22 = 0; [L40] signed short int var_1_23 = 64; [L41] signed short int var_1_24 = 25; [L42] signed short int var_1_25 = 0; [L43] float var_1_26 = 128.2; [L44] float var_1_27 = 16.625; [L45] signed long int var_1_28 = -100000; [L46] signed char var_1_30 = -25; [L47] signed short int var_1_31 = 0; [L48] signed char var_1_33 = 32; [L49] signed char var_1_34 = -4; [L50] unsigned long int var_1_35 = 1; [L51] double var_1_39 = 7.75; [L52] double var_1_40 = 99999.625; [L53] float var_1_41 = 255.2; [L54] unsigned char var_1_42 = 25; [L55] unsigned char var_1_43 = 64; [L56] unsigned char var_1_44 = 1; [L57] float var_1_45 = 255.5; [L58] float var_1_46 = 10.55; [L59] signed short int last_1_var_1_12 = 2; [L60] signed long int last_1_var_1_13 = -256; [L61] double last_1_var_1_14 = 127.75; [L62] unsigned char last_1_var_1_21 = 0; [L205] isInitial = 1 [L206] FCALL initially() [L207] COND TRUE 1 [L208] CALL updateLastVariables() [L195] last_1_var_1_12 = var_1_12 [L196] last_1_var_1_13 = var_1_13 [L197] last_1_var_1_14 = var_1_14 [L198] last_1_var_1_21 = var_1_21 [L208] RET updateLastVariables() [L209] CALL updateVariables() [L141] var_1_3 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_3 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L142] RET assume_abort_if_not(var_1_3 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L143] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L143] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L144] var_1_4 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L145] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L146] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L146] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L147] var_1_5 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L148] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L149] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L149] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L150] var_1_9 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L151] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L152] var_1_11 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L153] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L154] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L154] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L155] var_1_15 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L156] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L157] var_1_17 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L158] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L159] var_1_18 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L160] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L161] var_1_19 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L162] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L163] var_1_20 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L164] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L165] var_1_22 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L166] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L167] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L167] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L168] var_1_24 = __VERIFIER_nondet_short() [L169] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L169] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L170] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L170] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L171] var_1_25 = __VERIFIER_nondet_short() [L172] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L172] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L173] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L173] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L174] var_1_27 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L175] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L176] var_1_31 = __VERIFIER_nondet_short() [L177] CALL assume_abort_if_not(var_1_31 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L177] RET assume_abort_if_not(var_1_31 >= -32767) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L178] CALL assume_abort_if_not(var_1_31 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L178] RET assume_abort_if_not(var_1_31 <= 32767) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L179] var_1_33 = __VERIFIER_nondet_char() [L180] CALL assume_abort_if_not(var_1_33 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L180] RET assume_abort_if_not(var_1_33 >= -126) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L181] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L181] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L182] var_1_34 = __VERIFIER_nondet_char() [L183] CALL assume_abort_if_not(var_1_34 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L183] RET assume_abort_if_not(var_1_34 >= -63) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L184] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L184] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L185] var_1_40 = __VERIFIER_nondet_double() [L186] CALL assume_abort_if_not((var_1_40 >= -922337.2036854765600e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L186] RET assume_abort_if_not((var_1_40 >= -922337.2036854765600e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L187] var_1_43 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L188] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L189] CALL assume_abort_if_not(var_1_43 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=0, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=0, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L189] RET assume_abort_if_not(var_1_43 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=0, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L190] var_1_44 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_44 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L191] RET assume_abort_if_not(var_1_44 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L192] CALL assume_abort_if_not(var_1_44 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L192] RET assume_abort_if_not(var_1_44 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L209] RET updateVariables() [L210] CALL step() [L66] COND FALSE !(\read(last_1_var_1_21)) [L69] var_1_1 = (var_1_3 && var_1_5) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L71] var_1_41 = ((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) < (var_1_40)) ? (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) : (var_1_40))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=3, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L72] COND TRUE var_1_18 > var_1_9 [L73] var_1_23 = (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=3, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L77] signed long int stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_0=2, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=3, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L78] COND TRUE last_1_var_1_12 >= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=3, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L79] COND TRUE (var_1_9 - 1.00000000000025E12) >= last_1_var_1_14 [L80] var_1_6 = 200 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=3, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=200] [L87] var_1_26 = var_1_27 [L88] unsigned short int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_1=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=200] [L89] COND FALSE !(var_1_11 > stepLocal_1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=200] [L92] EXPR var_1_11 >> var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=200] [L92] COND FALSE !((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) [L95] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=200] [L97] var_1_16 = (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=200] [L98] COND TRUE ! var_1_21 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=200] [L99] COND FALSE !((var_1_31 == var_1_6) && var_1_21) [L102] var_1_35 = ((((var_1_6) < (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=200, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=200] [L105] var_1_46 = var_1_40 [L106] unsigned short int stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_3=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=200, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=6, var_1_4=0, var_1_5=1, var_1_6=200] [L107] COND FALSE !(stepLocal_3 == var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=200, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=6, var_1_4=0, var_1_5=1, var_1_6=200] [L110] COND FALSE !(var_1_27 <= var_1_16) [L115] var_1_30 = (50 + var_1_34) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=-100000, var_1_30=0, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=200, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=6, var_1_4=0, var_1_5=1, var_1_6=200] [L117] EXPR var_1_23 | var_1_13 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=-100000, var_1_30=0, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=200, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=6, var_1_4=0, var_1_5=1, var_1_6=200] [L117] COND FALSE !(var_1_33 < (var_1_23 | var_1_13)) [L120] unsigned short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_2=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=-100000, var_1_30=0, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=200, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=6, var_1_4=0, var_1_5=1, var_1_6=200] [L121] COND FALSE !(stepLocal_2 == var_1_12) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=-100000, var_1_30=0, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=200, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=6, var_1_4=0, var_1_5=1, var_1_6=200] [L126] var_1_28 = var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=200, var_1_30=0, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=200, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=6, var_1_4=0, var_1_5=1, var_1_6=200] [L127] COND TRUE 32u >= (((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6))) % 16u) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=200, var_1_30=0, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=200, var_1_39=31/4, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=6, var_1_4=0, var_1_5=1, var_1_6=200] [L128] COND FALSE !((-5 > var_1_31) && (var_1_6 <= ((((var_1_34) > (var_1_12)) ? (var_1_34) : (var_1_12))))) [L131] var_1_39 = ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=200, var_1_30=0, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=200, var_1_39=7, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=511/2, var_1_46=6, var_1_4=0, var_1_5=1, var_1_6=200] [L138] var_1_45 = 2.71f [L210] RET step() [L211] CALL, EXPR property() [L201] EXPR ((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=200, var_1_30=0, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=200, var_1_39=7, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=271/100, var_1_46=6, var_1_4=0, var_1_5=1, var_1_6=200] [L201-L202] return (((((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15)))) && (var_1_16 == ((float) (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))))))))) && ((var_1_11 == var_1_6) ? (var_1_21 == ((unsigned char) ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)))) : 1)) && ((var_1_18 > var_1_9) ? (var_1_23 == ((signed short int) (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))))) : (var_1_23 == ((signed short int) (last_1_var_1_13 + 1)))) ; [L211] RET, EXPR property() [L211] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=200, var_1_30=0, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=200, var_1_39=7, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=271/100, var_1_46=6, var_1_4=0, var_1_5=1, var_1_6=200] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=3, var_1_28=200, var_1_30=0, var_1_31=-32767, var_1_33=-126, var_1_34=-50, var_1_35=200, var_1_39=7, var_1_3=1, var_1_40=6, var_1_41=2, var_1_42=25, var_1_43=0, var_1_44=0, var_1_45=271/100, var_1_46=6, var_1_4=0, var_1_5=1, var_1_6=200] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 10, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1358 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1358 mSDsluCounter, 4111 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2470 mSDsCounter, 460 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 929 IncrementalHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 460 mSolverCounterUnsat, 1641 mSDtfsCounter, 929 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 662 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1553occurred in iteration=7, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 9 MinimizatonAttempts, 1698 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2304 NumberOfCodeBlocks, 2304 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1875 ConstructedInterpolants, 0 QuantifiedInterpolants, 5325 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 17856/17856 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 02:30:38,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-35.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 7206887450f4a9b0c4891eb37a14ba6cf6f69a3dc055684f3fcebb9c7410f059 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:30:40,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:30:40,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:30:40,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:30:40,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:30:40,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:30:40,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:30:40,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:30:40,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:30:40,849 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:30:40,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:30:40,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:30:40,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:30:40,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:30:40,850 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:30:40,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:30:40,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:30:40,851 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:30:40,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:30:40,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:30:40,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:30:40,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:30:40,854 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:30:40,854 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:30:40,855 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:30:40,855 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:30:40,855 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:30:40,855 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:30:40,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:30:40,856 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:30:40,856 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:30:40,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:30:40,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:30:40,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:30:40,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:30:40,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:30:40,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:30:40,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:30:40,858 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:30:40,858 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:30:40,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:30:40,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:30:40,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:30:40,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:30:40,861 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:30:40,861 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 -> 7206887450f4a9b0c4891eb37a14ba6cf6f69a3dc055684f3fcebb9c7410f059 [2024-10-13 02:30:41,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:30:41,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:30:41,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:30:41,157 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:30:41,158 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:30:41,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-35.i [2024-10-13 02:30:42,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:30:42,657 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:30:42,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-35.i [2024-10-13 02:30:42,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ece5ed78/b6d223464a1c486aac8759d86c8c4ce7/FLAGd4c63fab1 [2024-10-13 02:30:42,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ece5ed78/b6d223464a1c486aac8759d86c8c4ce7 [2024-10-13 02:30:42,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:30:42,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:30:42,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:30:42,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:30:42,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:30:42,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:30:42" (1/1) ... [2024-10-13 02:30:42,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25900bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:42, skipping insertion in model container [2024-10-13 02:30:42,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:30:42" (1/1) ... [2024-10-13 02:30:42,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:30:42,871 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-35.i[919,932] [2024-10-13 02:30:42,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:30:42,979 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:30:42,989 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-35.i[919,932] [2024-10-13 02:30:43,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:30:43,032 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:30:43,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:43 WrapperNode [2024-10-13 02:30:43,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:30:43,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:30:43,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:30:43,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:30:43,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:43" (1/1) ... [2024-10-13 02:30:43,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:43" (1/1) ... [2024-10-13 02:30:43,075 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 218 [2024-10-13 02:30:43,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:30:43,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:30:43,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:30:43,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:30:43,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:43" (1/1) ... [2024-10-13 02:30:43,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:43" (1/1) ... [2024-10-13 02:30:43,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:43" (1/1) ... [2024-10-13 02:30:43,113 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:30:43,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:43" (1/1) ... [2024-10-13 02:30:43,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:43" (1/1) ... [2024-10-13 02:30:43,129 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:43" (1/1) ... [2024-10-13 02:30:43,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:43" (1/1) ... [2024-10-13 02:30:43,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:43" (1/1) ... [2024-10-13 02:30:43,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:43" (1/1) ... [2024-10-13 02:30:43,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:30:43,151 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:30:43,151 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:30:43,151 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:30:43,152 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:43" (1/1) ... [2024-10-13 02:30:43,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:30:43,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:30:43,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:30:43,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:30:43,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:30:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:30:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:30:43,216 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:30:43,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:30:43,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:30:43,295 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:30:43,297 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:30:45,466 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 02:30:45,466 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:30:45,537 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:30:45,537 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:30:45,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:30:45 BoogieIcfgContainer [2024-10-13 02:30:45,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:30:45,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:30:45,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:30:45,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:30:45,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:30:42" (1/3) ... [2024-10-13 02:30:45,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34868a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:30:45, skipping insertion in model container [2024-10-13 02:30:45,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:43" (2/3) ... [2024-10-13 02:30:45,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34868a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:30:45, skipping insertion in model container [2024-10-13 02:30:45,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:30:45" (3/3) ... [2024-10-13 02:30:45,545 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-35.i [2024-10-13 02:30:45,558 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:30:45,559 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:30:45,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:30:45,628 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;@558e80b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:30:45,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:30:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 02:30:45,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-13 02:30:45,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:45,647 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:45,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:45,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:45,653 INFO L85 PathProgramCache]: Analyzing trace with hash 826746916, now seen corresponding path program 1 times [2024-10-13 02:30:45,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:30:45,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571344500] [2024-10-13 02:30:45,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:45,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:30:45,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:30:45,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:30:45,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 02:30:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:46,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:30:46,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:30:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 902 proven. 0 refuted. 0 times theorem prover too weak. 1082 trivial. 0 not checked. [2024-10-13 02:30:46,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:30:46,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:30:46,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571344500] [2024-10-13 02:30:46,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571344500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:46,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:46,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:30:46,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017746572] [2024-10-13 02:30:46,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:46,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:30:46,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:30:46,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:30:46,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:30:46,227 INFO L87 Difference]: Start difference. First operand has 89 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) 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, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 02:30:46,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:46,787 INFO L93 Difference]: Finished difference Result 174 states and 308 transitions. [2024-10-13 02:30:46,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:30:46,805 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, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 204 [2024-10-13 02:30:46,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:46,814 INFO L225 Difference]: With dead ends: 174 [2024-10-13 02:30:46,814 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 02:30:46,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:30:46,821 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:46,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 02:30:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 02:30:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 02:30:46,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 02:30:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 132 transitions. [2024-10-13 02:30:46,863 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 132 transitions. Word has length 204 [2024-10-13 02:30:46,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:46,863 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 132 transitions. [2024-10-13 02:30:46,864 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, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 02:30:46,864 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 132 transitions. [2024-10-13 02:30:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-13 02:30:46,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:46,867 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:46,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 02:30:47,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:30:47,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:47,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:47,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1323276316, now seen corresponding path program 1 times [2024-10-13 02:30:47,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:30:47,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555802231] [2024-10-13 02:30:47,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:47,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:30:47,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:30:47,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:30:47,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 02:30:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:47,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 02:30:47,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:30:47,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 02:30:47,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:30:47,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:30:47,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555802231] [2024-10-13 02:30:47,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555802231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:47,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:47,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:30:47,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531313174] [2024-10-13 02:30:47,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:47,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:30:47,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:30:47,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:30:47,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:30:47,990 INFO L87 Difference]: Start difference. First operand 86 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:50,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:30:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:50,182 INFO L93 Difference]: Finished difference Result 300 states and 458 transitions. [2024-10-13 02:30:50,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:30:50,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-10-13 02:30:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:50,206 INFO L225 Difference]: With dead ends: 300 [2024-10-13 02:30:50,206 INFO L226 Difference]: Without dead ends: 215 [2024-10-13 02:30:50,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:30:50,208 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 146 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:50,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 432 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 02:30:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-13 02:30:50,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 168. [2024-10-13 02:30:50,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 101 states have (on average 1.2772277227722773) internal successors, (129), 101 states have internal predecessors, (129), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 02:30:50,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 257 transitions. [2024-10-13 02:30:50,254 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 257 transitions. Word has length 204 [2024-10-13 02:30:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:50,256 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 257 transitions. [2024-10-13 02:30:50,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 257 transitions. [2024-10-13 02:30:50,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-13 02:30:50,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:50,263 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:50,281 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 (3)] Ended with exit code 0 [2024-10-13 02:30:50,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:30:50,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:50,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:50,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1714209782, now seen corresponding path program 1 times [2024-10-13 02:30:50,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:30:50,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717933490] [2024-10-13 02:30:50,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:50,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:30:50,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:30:50,468 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:30:50,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 02:30:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:50,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:30:50,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:30:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 02:30:51,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:30:51,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:30:51,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717933490] [2024-10-13 02:30:51,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717933490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:51,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:51,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:30:51,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402350047] [2024-10-13 02:30:51,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:51,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:30:51,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:30:51,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:30:51,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:30:51,286 INFO L87 Difference]: Start difference. First operand 168 states and 257 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:53,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:30:53,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:53,879 INFO L93 Difference]: Finished difference Result 541 states and 826 transitions. [2024-10-13 02:30:53,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:30:53,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-10-13 02:30:53,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:53,903 INFO L225 Difference]: With dead ends: 541 [2024-10-13 02:30:53,903 INFO L226 Difference]: Without dead ends: 374 [2024-10-13 02:30:53,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:30:53,905 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 101 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:53,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 481 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 02:30:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-13 02:30:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 333. [2024-10-13 02:30:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 200 states have (on average 1.27) internal successors, (254), 200 states have internal predecessors, (254), 128 states have call successors, (128), 4 states have call predecessors, (128), 4 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2024-10-13 02:30:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 510 transitions. [2024-10-13 02:30:53,959 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 510 transitions. Word has length 205 [2024-10-13 02:30:53,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:53,960 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 510 transitions. [2024-10-13 02:30:53,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 510 transitions. [2024-10-13 02:30:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-13 02:30:53,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:53,962 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:53,981 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 (4)] Ended with exit code 0 [2024-10-13 02:30:54,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:30:54,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:54,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:54,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1485222442, now seen corresponding path program 1 times [2024-10-13 02:30:54,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:30:54,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746707093] [2024-10-13 02:30:54,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:54,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:30:54,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:30:54,168 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:30:54,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 02:30:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:54,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 02:30:54,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:30:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 02:30:54,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:30:54,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:30:54,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746707093] [2024-10-13 02:30:54,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746707093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:54,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:54,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 02:30:54,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578643678] [2024-10-13 02:30:54,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:54,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 02:30:54,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:30:54,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 02:30:54,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:30:54,699 INFO L87 Difference]: Start difference. First operand 333 states and 510 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:56,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:30:57,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:57,300 INFO L93 Difference]: Finished difference Result 901 states and 1374 transitions. [2024-10-13 02:30:57,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 02:30:57,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2024-10-13 02:30:57,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:57,313 INFO L225 Difference]: With dead ends: 901 [2024-10-13 02:30:57,313 INFO L226 Difference]: Without dead ends: 734 [2024-10-13 02:30:57,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:30:57,316 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 201 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:57,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 538 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 02:30:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-10-13 02:30:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 406. [2024-10-13 02:30:57,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 257 states have (on average 1.2918287937743191) internal successors, (332), 259 states have internal predecessors, (332), 142 states have call successors, (142), 6 states have call predecessors, (142), 6 states have return successors, (142), 140 states have call predecessors, (142), 142 states have call successors, (142) [2024-10-13 02:30:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 616 transitions. [2024-10-13 02:30:57,373 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 616 transitions. Word has length 206 [2024-10-13 02:30:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:57,374 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 616 transitions. [2024-10-13 02:30:57,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 02:30:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 616 transitions. [2024-10-13 02:30:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-13 02:30:57,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:57,376 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:57,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 02:30:57,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:30:57,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:57,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:57,582 INFO L85 PathProgramCache]: Analyzing trace with hash -784157864, now seen corresponding path program 1 times [2024-10-13 02:30:57,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:30:57,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464527304] [2024-10-13 02:30:57,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:57,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:30:57,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:30:57,586 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:30:57,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 02:30:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:58,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 02:30:58,030 INFO L278 TraceCheckSpWp]: Computing forward predicates...