./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-ci_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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-ci_file-38.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 d59148c6d2090f3d8ed862bab35d53edf07611b01ddefbfa4c33cef9d2bfdcf5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:27:07,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:27:07,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 07:27:07,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:27:07,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:27:07,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:27:07,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:27:07,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:27:07,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:27:07,857 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:27:07,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:27:07,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:27:07,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:27:07,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:27:07,859 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:27:07,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:27:07,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:27:07,860 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:27:07,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 07:27:07,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:27:07,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:27:07,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:27:07,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:27:07,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:27:07,862 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:27:07,863 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:27:07,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:27:07,863 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:27:07,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:27:07,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:27:07,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:27:07,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:27:07,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:27:07,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:27:07,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:27:07,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:27:07,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 07:27:07,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 07:27:07,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:27:07,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:27:07,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:27:07,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:27:07,869 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 -> d59148c6d2090f3d8ed862bab35d53edf07611b01ddefbfa4c33cef9d2bfdcf5 [2024-10-24 07:27:08,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:27:08,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:27:08,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:27:08,182 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:27:08,182 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:27:08,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-38.i [2024-10-24 07:27:09,686 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:27:09,931 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:27:09,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-38.i [2024-10-24 07:27:09,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f07adbbf3/b07e47b5f1d34691ad9d5cc77541a997/FLAG80f4fd9aa [2024-10-24 07:27:10,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f07adbbf3/b07e47b5f1d34691ad9d5cc77541a997 [2024-10-24 07:27:10,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:27:10,272 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:27:10,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:27:10,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:27:10,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:27:10,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c0a5d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10, skipping insertion in model container [2024-10-24 07:27:10,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:27:10,486 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-ci_file-38.i[919,932] [2024-10-24 07:27:10,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:27:10,574 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:27:10,583 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-ci_file-38.i[919,932] [2024-10-24 07:27:10,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:27:10,642 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:27:10,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10 WrapperNode [2024-10-24 07:27:10,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:27:10,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:27:10,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:27:10,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:27:10,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,661 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,698 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2024-10-24 07:27:10,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:27:10,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:27:10,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:27:10,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:27:10,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,736 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-24 07:27:10,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,750 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:27:10,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:27:10,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:27:10,761 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:27:10,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:27:10,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:27:10,804 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-24 07:27:10,806 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-24 07:27:10,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:27:10,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:27:10,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:27:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 07:27:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:27:10,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:27:10,933 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:27:10,935 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:27:11,359 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 07:27:11,360 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:27:11,399 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:27:11,399 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:27:11,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:27:11 BoogieIcfgContainer [2024-10-24 07:27:11,400 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:27:11,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:27:11,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:27:11,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:27:11,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:27:10" (1/3) ... [2024-10-24 07:27:11,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c14464d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:27:11, skipping insertion in model container [2024-10-24 07:27:11,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (2/3) ... [2024-10-24 07:27:11,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c14464d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:27:11, skipping insertion in model container [2024-10-24 07:27:11,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:27:11" (3/3) ... [2024-10-24 07:27:11,409 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-38.i [2024-10-24 07:27:11,425 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:27:11,426 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:27:11,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:27:11,500 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;@53929a30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:27:11,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:27:11,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 59 states have internal predecessors, (88), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:27:11,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 07:27:11,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:11,526 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:27:11,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:11,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1477088448, now seen corresponding path program 1 times [2024-10-24 07:27:11,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:27:11,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621074118] [2024-10-24 07:27:11,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:11,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:27:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:27:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:27:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:27:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:27:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:27:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:27:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:27:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:27:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:27:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:27:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:27:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:27:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 07:27:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:27:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 07:27:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 07:27:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 07:27:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:27:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:27:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 07:27:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:27:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 07:27:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:27:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 07:27:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:27:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:27:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:27:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 07:27:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:27:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 07:27:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:27:12,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:27:12,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621074118] [2024-10-24 07:27:12,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621074118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:27:12,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:27:12,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:27:12,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458835467] [2024-10-24 07:27:12,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:27:12,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:27:12,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:27:12,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:27:12,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:27:12,160 INFO L87 Difference]: Start difference. First operand has 91 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 59 states have internal predecessors, (88), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 07:27:12,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:12,214 INFO L93 Difference]: Finished difference Result 179 states and 324 transitions. [2024-10-24 07:27:12,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:27:12,218 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 188 [2024-10-24 07:27:12,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:12,227 INFO L225 Difference]: With dead ends: 179 [2024-10-24 07:27:12,227 INFO L226 Difference]: Without dead ends: 89 [2024-10-24 07:27:12,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:27:12,235 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:12,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:27:12,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-24 07:27:12,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-24 07:27:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 57 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:27:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 141 transitions. [2024-10-24 07:27:12,291 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 141 transitions. Word has length 188 [2024-10-24 07:27:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:12,292 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 141 transitions. [2024-10-24 07:27:12,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 07:27:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 141 transitions. [2024-10-24 07:27:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 07:27:12,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:12,300 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:27:12,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 07:27:12,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:12,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:12,301 INFO L85 PathProgramCache]: Analyzing trace with hash 50016972, now seen corresponding path program 1 times [2024-10-24 07:27:12,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:27:12,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198486498] [2024-10-24 07:27:12,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:12,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:27:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:27:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:27:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:27:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:27:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:27:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:27:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:27:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:27:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:27:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:27:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:27:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:27:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 07:27:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:27:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 07:27:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 07:27:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 07:27:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:27:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:27:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 07:27:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:27:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 07:27:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:27:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 07:27:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:27:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:27:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:27:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 07:27:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:27:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 07:27:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:27:12,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:27:12,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198486498] [2024-10-24 07:27:12,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198486498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:27:12,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:27:12,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:27:12,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757861652] [2024-10-24 07:27:12,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:27:12,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:27:12,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:27:12,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:27:12,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:27:12,798 INFO L87 Difference]: Start difference. First operand 89 states and 141 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:27:12,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:12,853 INFO L93 Difference]: Finished difference Result 178 states and 283 transitions. [2024-10-24 07:27:12,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:27:12,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2024-10-24 07:27:12,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:12,857 INFO L225 Difference]: With dead ends: 178 [2024-10-24 07:27:12,858 INFO L226 Difference]: Without dead ends: 90 [2024-10-24 07:27:12,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:27:12,861 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:12,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:27:12,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-24 07:27:12,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-24 07:27:12,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:27:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 142 transitions. [2024-10-24 07:27:12,875 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 142 transitions. Word has length 188 [2024-10-24 07:27:12,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:12,878 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 142 transitions. [2024-10-24 07:27:12,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:27:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 142 transitions. [2024-10-24 07:27:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-24 07:27:12,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:12,886 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:27:12,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 07:27:12,887 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:12,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash 796202767, now seen corresponding path program 1 times [2024-10-24 07:27:12,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:27:12,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455393787] [2024-10-24 07:27:12,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:12,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:27:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:27:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:27:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:27:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:27:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:27:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:27:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:27:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:27:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:27:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:27:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:27:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:27:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 07:27:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:27:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 07:27:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 07:27:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 07:27:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:27:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:27:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 07:27:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:27:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 07:27:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:27:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 07:27:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:27:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:27:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:27:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 07:27:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:27:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 07:27:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:27:13,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:27:13,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455393787] [2024-10-24 07:27:13,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455393787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:27:13,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:27:13,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 07:27:13,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683356142] [2024-10-24 07:27:13,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:27:13,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:27:13,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:27:13,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:27:13,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:27:13,516 INFO L87 Difference]: Start difference. First operand 90 states and 142 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:27:13,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:13,814 INFO L93 Difference]: Finished difference Result 350 states and 553 transitions. [2024-10-24 07:27:13,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 07:27:13,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2024-10-24 07:27:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:13,823 INFO L225 Difference]: With dead ends: 350 [2024-10-24 07:27:13,825 INFO L226 Difference]: Without dead ends: 261 [2024-10-24 07:27:13,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:27:13,829 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 296 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:13,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 579 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:27:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-24 07:27:13,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 177. [2024-10-24 07:27:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 114 states have (on average 1.412280701754386) internal successors, (161), 114 states have internal predecessors, (161), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 07:27:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 281 transitions. [2024-10-24 07:27:13,876 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 281 transitions. Word has length 190 [2024-10-24 07:27:13,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:13,876 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 281 transitions. [2024-10-24 07:27:13,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:27:13,877 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 281 transitions. [2024-10-24 07:27:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-24 07:27:13,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:13,884 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:27:13,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 07:27:13,884 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:13,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:13,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1311310293, now seen corresponding path program 1 times [2024-10-24 07:27:13,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:27:13,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286495657] [2024-10-24 07:27:13,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:13,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:27:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:27:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:27:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:27:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:27:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:27:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:27:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:27:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:27:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:27:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:27:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:27:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:27:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 07:27:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:27:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 07:27:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 07:27:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 07:27:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:27:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:27:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 07:27:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:27:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 07:27:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:27:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 07:27:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:27:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:27:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:27:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 07:27:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:27:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 07:27:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:27:14,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:27:14,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286495657] [2024-10-24 07:27:14,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286495657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:27:14,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:27:14,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 07:27:14,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181179204] [2024-10-24 07:27:14,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:27:14,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:27:14,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:27:14,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:27:14,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:27:14,416 INFO L87 Difference]: Start difference. First operand 177 states and 281 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:27:14,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:14,776 INFO L93 Difference]: Finished difference Result 593 states and 945 transitions. [2024-10-24 07:27:14,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 07:27:14,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2024-10-24 07:27:14,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:14,784 INFO L225 Difference]: With dead ends: 593 [2024-10-24 07:27:14,787 INFO L226 Difference]: Without dead ends: 417 [2024-10-24 07:27:14,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 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-24 07:27:14,789 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 140 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:14,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 510 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 07:27:14,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-24 07:27:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 351. [2024-10-24 07:27:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 226 states have (on average 1.3893805309734513) internal successors, (314), 226 states have internal predecessors, (314), 120 states have call successors, (120), 4 states have call predecessors, (120), 4 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-24 07:27:14,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 554 transitions. [2024-10-24 07:27:14,881 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 554 transitions. Word has length 191 [2024-10-24 07:27:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:14,883 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 554 transitions. [2024-10-24 07:27:14,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:27:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 554 transitions. [2024-10-24 07:27:14,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-24 07:27:14,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:14,887 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:27:14,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 07:27:14,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:14,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:14,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1530165011, now seen corresponding path program 1 times [2024-10-24 07:27:14,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:27:14,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424139090] [2024-10-24 07:27:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:27:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:27:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:27:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:27:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:27:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:27:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:27:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:27:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:27:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:27:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:27:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:27:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:27:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 07:27:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:27:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 07:27:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 07:27:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 07:27:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:27:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:27:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 07:27:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:27:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 07:27:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:27:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 07:27:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:27:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:27:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:27:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 07:27:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:27:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 07:27:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 07:27:15,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:27:15,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424139090] [2024-10-24 07:27:15,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424139090] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:27:15,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297647833] [2024-10-24 07:27:15,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:15,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:27:15,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:27:15,415 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-24 07:27:15,417 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-24 07:27:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 07:27:15,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:27:16,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-10-24 07:27:16,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:27:16,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 07:27:16,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297647833] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:27:16,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:27:16,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2024-10-24 07:27:16,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238987946] [2024-10-24 07:27:16,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:27:16,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 07:27:16,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:27:16,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 07:27:16,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-10-24 07:27:16,598 INFO L87 Difference]: Start difference. First operand 351 states and 554 transitions. Second operand has 17 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 7 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 7 states have call predecessors, (90), 7 states have call successors, (90) [2024-10-24 07:27:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:18,014 INFO L93 Difference]: Finished difference Result 1153 states and 1790 transitions. [2024-10-24 07:27:18,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-24 07:27:18,015 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 7 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 7 states have call predecessors, (90), 7 states have call successors, (90) Word has length 191 [2024-10-24 07:27:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:18,022 INFO L225 Difference]: With dead ends: 1153 [2024-10-24 07:27:18,022 INFO L226 Difference]: Without dead ends: 803 [2024-10-24 07:27:18,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=1150, Unknown=0, NotChecked=0, Total=1560 [2024-10-24 07:27:18,026 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 676 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:18,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 893 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 07:27:18,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-10-24 07:27:18,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 637. [2024-10-24 07:27:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 426 states have (on average 1.3896713615023475) internal successors, (592), 428 states have internal predecessors, (592), 200 states have call successors, (200), 10 states have call predecessors, (200), 10 states have return successors, (200), 198 states have call predecessors, (200), 200 states have call successors, (200) [2024-10-24 07:27:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 992 transitions. [2024-10-24 07:27:18,126 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 992 transitions. Word has length 191 [2024-10-24 07:27:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:18,127 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 992 transitions. [2024-10-24 07:27:18,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 7 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 7 states have call predecessors, (90), 7 states have call successors, (90) [2024-10-24 07:27:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 992 transitions. [2024-10-24 07:27:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-24 07:27:18,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:18,130 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:27:18,149 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-24 07:27:18,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:27:18,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:18,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:18,332 INFO L85 PathProgramCache]: Analyzing trace with hash -182482779, now seen corresponding path program 1 times [2024-10-24 07:27:18,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:27:18,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340464863] [2024-10-24 07:27:18,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:18,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:27:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 07:27:18,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [140985353] [2024-10-24 07:27:18,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:18,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:27:18,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:27:18,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:27:18,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 07:27:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:27:18,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 07:27:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:27:18,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 07:27:18,749 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 07:27:18,750 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 07:27:18,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 07:27:18,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 07:27:18,956 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 07:27:19,092 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 07:27:19,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:27:19 BoogieIcfgContainer [2024-10-24 07:27:19,095 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 07:27:19,096 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 07:27:19,096 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 07:27:19,096 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 07:27:19,097 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:27:11" (3/4) ... [2024-10-24 07:27:19,099 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 07:27:19,100 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 07:27:19,100 INFO L158 Benchmark]: Toolchain (without parser) took 8828.50ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 139.4MB in the beginning and 147.8MB in the end (delta: -8.4MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2024-10-24 07:27:19,101 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 169.9MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:27:19,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.20ms. Allocated memory is still 169.9MB. Free memory was 139.2MB in the beginning and 126.5MB in the end (delta: 12.7MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-10-24 07:27:19,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.84ms. Allocated memory is still 169.9MB. Free memory was 126.5MB in the beginning and 122.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 07:27:19,102 INFO L158 Benchmark]: Boogie Preprocessor took 60.21ms. Allocated memory is still 169.9MB. Free memory was 122.3MB in the beginning and 118.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 07:27:19,102 INFO L158 Benchmark]: RCFGBuilder took 639.52ms. Allocated memory is still 169.9MB. Free memory was 118.1MB in the beginning and 114.8MB in the end (delta: 3.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 07:27:19,102 INFO L158 Benchmark]: TraceAbstraction took 7693.58ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 114.8MB in the beginning and 147.8MB in the end (delta: -33.0MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2024-10-24 07:27:19,103 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 247.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:27:19,105 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.18ms. Allocated memory is still 169.9MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.20ms. Allocated memory is still 169.9MB. Free memory was 139.2MB in the beginning and 126.5MB in the end (delta: 12.7MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.84ms. Allocated memory is still 169.9MB. Free memory was 126.5MB in the beginning and 122.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.21ms. Allocated memory is still 169.9MB. Free memory was 122.3MB in the beginning and 118.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 639.52ms. Allocated memory is still 169.9MB. Free memory was 118.1MB in the beginning and 114.8MB in the end (delta: 3.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7693.58ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 114.8MB in the beginning and 147.8MB in the end (delta: -33.0MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 247.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of shiftRight at line 56, overapproximation of bitwiseOr at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] unsigned short int var_1_8 = 4; [L27] signed long int var_1_11 = 100; [L28] signed long int var_1_12 = 8; [L29] unsigned short int var_1_13 = 128; [L30] double var_1_14 = 64.5; [L31] signed short int var_1_15 = 4; [L32] signed long int var_1_16 = -8; [L33] double var_1_17 = 255.5; [L34] double var_1_18 = 0.6; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 999999.25; [L37] signed short int var_1_21 = -64; [L38] signed char var_1_25 = -128; [L39] signed char var_1_26 = -8; [L40] unsigned char var_1_27 = 32; [L41] unsigned char var_1_31 = 32; [L42] unsigned char var_1_32 = 25; [L43] unsigned char var_1_33 = 128; [L44] double var_1_34 = 499.6; [L45] unsigned char var_1_36 = 200; [L46] unsigned short int var_1_37 = 2; [L47] unsigned short int var_1_41 = 36532; [L48] unsigned short int var_1_42 = 32367; [L49] signed char var_1_43 = -2; [L50] unsigned short int last_1_var_1_8 = 4; [L51] signed short int last_1_var_1_21 = -64; [L52] signed char last_1_var_1_25 = -128; [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L182] last_1_var_1_8 = var_1_8 [L183] last_1_var_1_21 = var_1_21 [L184] last_1_var_1_25 = var_1_25 [L194] RET updateLastVariables() [L195] CALL updateVariables() [L134] var_1_4 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L135] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L136] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L136] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L137] var_1_6 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_7=0, var_1_8=4] [L138] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_7=0, var_1_8=4] [L139] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L139] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L140] var_1_11 = __VERIFIER_nondet_long() [L141] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L141] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L142] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L142] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L143] var_1_12 = __VERIFIER_nondet_long() [L144] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L144] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L145] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L145] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L146] var_1_13 = __VERIFIER_nondet_ushort() [L147] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L147] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L148] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L148] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L149] var_1_15 = __VERIFIER_nondet_short() [L150] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L150] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L151] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L151] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L152] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L152] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L153] var_1_16 = __VERIFIER_nondet_long() [L154] CALL assume_abort_if_not(var_1_16 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L154] RET assume_abort_if_not(var_1_16 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L155] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L155] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L156] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L156] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L157] var_1_17 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L158] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L159] var_1_18 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L160] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L161] var_1_19 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_19 >= 0.0F && 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_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L162] RET assume_abort_if_not((var_1_19 >= 0.0F && 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_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L163] var_1_20 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_20 >= 0.0F && 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_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L164] RET assume_abort_if_not((var_1_20 >= 0.0F && 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_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L165] var_1_26 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L166] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L167] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L167] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L168] var_1_31 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L169] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L170] CALL assume_abort_if_not(var_1_31 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L170] RET assume_abort_if_not(var_1_31 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L171] var_1_32 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L172] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L173] CALL assume_abort_if_not(var_1_32 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L173] RET assume_abort_if_not(var_1_32 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L174] var_1_41 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_41 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L175] RET assume_abort_if_not(var_1_41 >= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L176] CALL assume_abort_if_not(var_1_41 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L176] RET assume_abort_if_not(var_1_41 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L177] var_1_42 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_42 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L178] RET assume_abort_if_not(var_1_42 >= 16383) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L179] CALL assume_abort_if_not(var_1_42 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L179] RET assume_abort_if_not(var_1_42 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L195] RET updateVariables() [L196] CALL step() [L56] EXPR last_1_var_1_8 >> var_1_15 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L56] COND TRUE (last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15) [L57] var_1_21 = (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L61] signed long int stepLocal_1 = ((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12; [L62] signed long int stepLocal_0 = last_1_var_1_21 + last_1_var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, stepLocal_1=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L63] COND FALSE !((last_1_var_1_21 * last_1_var_1_21) < stepLocal_1) [L68] var_1_8 = var_1_13 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=1] [L70] COND FALSE !(var_1_14 >= var_1_18) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=1] [L75] COND TRUE ! (var_1_21 > var_1_8) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=1] [L76] COND TRUE \read(var_1_4) [L77] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=1] [L80] COND TRUE var_1_14 >= ((((var_1_19) < (var_1_17)) ? (var_1_19) : (var_1_17))) [L81] var_1_33 = ((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=1, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=1] [L83] var_1_34 = var_1_19 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_19=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=1, var_1_34=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=1] [L84] COND FALSE !(var_1_42 > var_1_41) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_19=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=1, var_1_34=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=1] [L91] COND FALSE !((8 / var_1_15) < (64 / var_1_16)) [L98] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=3, var_1_15=8, var_1_16=64, var_1_18=3, var_1_19=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=1, var_1_34=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=1] [L100] COND TRUE (- var_1_14) <= var_1_14 [L101] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=3, var_1_15=8, var_1_16=64, var_1_18=3, var_1_19=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_31=2, var_1_32=1, var_1_33=1, var_1_34=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=1] [L109] COND FALSE !(var_1_14 >= (((((((var_1_19) > (var_1_19)) ? (var_1_19) : (var_1_19))) < 0 ) ? -((((var_1_19) > (var_1_19)) ? (var_1_19) : (var_1_19))) : ((((var_1_19) > (var_1_19)) ? (var_1_19) : (var_1_19)))))) [L116] var_1_27 = var_1_32 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=3, var_1_15=8, var_1_16=64, var_1_18=3, var_1_19=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=1, var_1_31=2, var_1_32=1, var_1_33=1, var_1_34=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=1] [L118] COND TRUE var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14)))) [L119] var_1_7 = (var_1_1 && (! 1)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=3, var_1_15=8, var_1_16=64, var_1_18=3, var_1_19=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=1, var_1_31=2, var_1_32=1, var_1_33=1, var_1_34=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=1] [L121] EXPR ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) | (-10 * var_1_8) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=3, var_1_15=8, var_1_16=64, var_1_18=3, var_1_19=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=1, var_1_31=2, var_1_32=1, var_1_33=1, var_1_34=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=1] [L121] COND TRUE -2 > (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) | (-10 * var_1_8)) [L122] var_1_37 = ((((((((25) < (var_1_8)) ? (25) : (var_1_8)))) > (((((var_1_32 + var_1_8) < 0 ) ? -(var_1_32 + var_1_8) : (var_1_32 + var_1_8))))) ? (((((25) < (var_1_8)) ? (25) : (var_1_8)))) : (((((var_1_32 + var_1_8) < 0 ) ? -(var_1_32 + var_1_8) : (var_1_32 + var_1_8)))))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=3, var_1_15=8, var_1_16=64, var_1_18=3, var_1_19=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=1, var_1_31=2, var_1_32=1, var_1_33=1, var_1_34=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=1] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR ((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=3, var_1_15=8, var_1_16=64, var_1_18=3, var_1_19=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=1, var_1_31=2, var_1_32=1, var_1_33=1, var_1_34=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=1] [L187-L188] return (((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25)))) && ((! (var_1_21 > var_1_8)) ? (var_1_4 ? (var_1_25 == ((signed char) var_1_26)) : 1) : 1) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=3, var_1_15=8, var_1_16=64, var_1_18=3, var_1_19=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=1, var_1_31=2, var_1_32=1, var_1_33=1, var_1_34=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=3, var_1_15=8, var_1_16=64, var_1_18=3, var_1_19=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=1, var_1_31=2, var_1_32=1, var_1_33=1, var_1_34=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 6, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1139 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1112 mSDsluCounter, 2388 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1654 mSDsCounter, 614 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1197 IncrementalHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 614 mSolverCounterUnsat, 734 mSDtfsCounter, 1197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 763 GetRequests, 714 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=637occurred in iteration=5, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 316 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1523 NumberOfCodeBlocks, 1523 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1323 ConstructedInterpolants, 0 QuantifiedInterpolants, 3698 SizeOfPredicates, 2 NumberOfNonLiveVariables, 437 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 12027/12180 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-24 07:27:19,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-ci_file-38.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 d59148c6d2090f3d8ed862bab35d53edf07611b01ddefbfa4c33cef9d2bfdcf5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:27:21,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:27:21,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 07:27:21,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:27:21,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:27:21,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:27:21,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:27:21,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:27:21,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:27:21,408 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:27:21,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:27:21,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:27:21,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:27:21,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:27:21,410 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:27:21,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:27:21,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:27:21,411 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:27:21,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:27:21,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:27:21,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:27:21,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:27:21,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:27:21,414 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 07:27:21,415 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 07:27:21,415 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:27:21,415 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 07:27:21,416 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:27:21,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:27:21,416 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:27:21,416 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:27:21,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:27:21,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:27:21,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:27:21,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:27:21,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:27:21,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:27:21,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:27:21,419 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 07:27:21,419 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 07:27:21,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:27:21,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:27:21,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:27:21,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:27:21,421 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 07:27:21,422 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 -> d59148c6d2090f3d8ed862bab35d53edf07611b01ddefbfa4c33cef9d2bfdcf5 [2024-10-24 07:27:21,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:27:21,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:27:21,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:27:21,798 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:27:21,799 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:27:21,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-38.i [2024-10-24 07:27:23,353 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:27:23,568 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:27:23,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-38.i [2024-10-24 07:27:23,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa5527e84/72b5fd6d85a24bc0ae0adf56dc006a81/FLAG4ad563659 [2024-10-24 07:27:23,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa5527e84/72b5fd6d85a24bc0ae0adf56dc006a81 [2024-10-24 07:27:23,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:27:23,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:27:23,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:27:23,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:27:23,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:27:23,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:27:23" (1/1) ... [2024-10-24 07:27:23,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@636ea1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:23, skipping insertion in model container [2024-10-24 07:27:23,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:27:23" (1/1) ... [2024-10-24 07:27:23,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:27:23,864 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-ci_file-38.i[919,932] [2024-10-24 07:27:23,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:27:23,973 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:27:23,987 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-ci_file-38.i[919,932] [2024-10-24 07:27:24,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:27:24,061 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:27:24,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24 WrapperNode [2024-10-24 07:27:24,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:27:24,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:27:24,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:27:24,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:27:24,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,127 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-10-24 07:27:24,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:27:24,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:27:24,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:27:24,132 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:27:24,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,171 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-24 07:27:24,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,187 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:27:24,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:27:24,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:27:24,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:27:24,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:27:24,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:27:24,248 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-24 07:27:24,254 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-24 07:27:24,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:27:24,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 07:27:24,296 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:27:24,296 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:27:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:27:24,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:27:24,389 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:27:24,391 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:27:30,130 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 07:27:30,131 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:27:30,197 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:27:30,201 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:27:30,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:27:30 BoogieIcfgContainer [2024-10-24 07:27:30,202 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:27:30,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:27:30,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:27:30,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:27:30,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:27:23" (1/3) ... [2024-10-24 07:27:30,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b2b71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:27:30, skipping insertion in model container [2024-10-24 07:27:30,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (2/3) ... [2024-10-24 07:27:30,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b2b71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:27:30, skipping insertion in model container [2024-10-24 07:27:30,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:27:30" (3/3) ... [2024-10-24 07:27:30,213 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-38.i [2024-10-24 07:27:30,230 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:27:30,230 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:27:30,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:27:30,313 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;@4222e876, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:27:30,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:27:30,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:27:30,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-24 07:27:30,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:30,335 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:27:30,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:30,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:30,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1392292670, now seen corresponding path program 1 times [2024-10-24 07:27:30,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:27:30,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791018255] [2024-10-24 07:27:30,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:30,360 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-24 07:27:30,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:27:30,363 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-24 07:27:30,366 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-24 07:27:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:30,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 07:27:30,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:27:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:27:30,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:27:30,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:27:30,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791018255] [2024-10-24 07:27:30,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791018255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:27:30,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:27:30,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:27:30,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179858024] [2024-10-24 07:27:30,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:27:30,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:27:30,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:27:31,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:27:31,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:27:31,005 INFO L87 Difference]: Start difference. First operand has 81 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:27:33,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:27:33,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:33,094 INFO L93 Difference]: Finished difference Result 159 states and 294 transitions. [2024-10-24 07:27:33,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:27:33,132 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 184 [2024-10-24 07:27:33,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:33,139 INFO L225 Difference]: With dead ends: 159 [2024-10-24 07:27:33,140 INFO L226 Difference]: Without dead ends: 79 [2024-10-24 07:27:33,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 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-24 07:27:33,146 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:33,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 07:27:33,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-24 07:27:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-24 07:27:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:27:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 125 transitions. [2024-10-24 07:27:33,189 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 125 transitions. Word has length 184 [2024-10-24 07:27:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:33,191 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 125 transitions. [2024-10-24 07:27:33,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:27:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 125 transitions. [2024-10-24 07:27:33,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-24 07:27:33,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:33,197 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:27:33,222 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-24 07:27:33,398 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-24 07:27:33,398 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:33,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:33,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1881606272, now seen corresponding path program 1 times [2024-10-24 07:27:33,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:27:33,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664286076] [2024-10-24 07:27:33,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:33,400 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-24 07:27:33,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:27:33,404 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-24 07:27:33,406 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-24 07:27:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:33,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 07:27:33,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:27:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:27:35,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:27:35,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:27:35,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664286076] [2024-10-24 07:27:35,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664286076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:27:35,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:27:35,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:27:35,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275477298] [2024-10-24 07:27:35,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:27:35,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:27:35,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:27:35,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:27:35,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:27:35,998 INFO L87 Difference]: Start difference. First operand 79 states and 125 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:27:40,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:27:41,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:27:45,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:27:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:45,830 INFO L93 Difference]: Finished difference Result 358 states and 566 transitions. [2024-10-24 07:27:45,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 07:27:45,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 184 [2024-10-24 07:27:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:45,837 INFO L225 Difference]: With dead ends: 358 [2024-10-24 07:27:45,837 INFO L226 Difference]: Without dead ends: 280 [2024-10-24 07:27:45,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 07:27:45,840 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 224 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:45,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 670 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 9.6s Time] [2024-10-24 07:27:45,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-24 07:27:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 155. [2024-10-24 07:27:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 92 states have internal predecessors, (127), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 07:27:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 247 transitions. [2024-10-24 07:27:45,912 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 247 transitions. Word has length 184 [2024-10-24 07:27:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:45,915 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 247 transitions. [2024-10-24 07:27:45,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:27:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 247 transitions. [2024-10-24 07:27:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-24 07:27:45,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:45,925 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:27:45,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 07:27:46,126 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-24 07:27:46,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:46,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:46,127 INFO L85 PathProgramCache]: Analyzing trace with hash -2122325743, now seen corresponding path program 1 times [2024-10-24 07:27:46,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:27:46,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076100943] [2024-10-24 07:27:46,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:46,129 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-24 07:27:46,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:27:46,131 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-24 07:27:46,133 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-24 07:27:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:46,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 07:27:46,604 INFO L278 TraceCheckSpWp]: Computing forward predicates...