./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-ps-ci_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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-ps-ci_file-51.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 5fae3db68adc0ffe998fc93858a245ffb30205c57f234c7f9849920ee7dba257 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:09:31,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:09:31,911 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:09:31,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:09:31,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:09:31,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:09:31,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:09:31,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:09:31,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:09:31,937 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:09:31,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:09:31,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:09:31,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:09:31,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:09:31,940 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:09:31,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:09:31,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:09:31,941 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:09:31,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:09:31,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:09:31,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:09:31,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:09:31,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:09:31,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:09:31,944 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:09:31,944 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:09:31,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:09:31,944 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:09:31,945 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:09:31,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:09:31,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:09:31,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:09:31,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:09:31,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:09:31,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:09:31,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:09:31,948 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:09:31,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:09:31,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:09:31,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:09:31,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:09:31,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:09:31,949 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 -> 5fae3db68adc0ffe998fc93858a245ffb30205c57f234c7f9849920ee7dba257 [2024-11-20 05:09:32,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:09:32,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:09:32,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:09:32,156 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:09:32,157 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:09:32,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-51.i [2024-11-20 05:09:33,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:09:33,668 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:09:33,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-51.i [2024-11-20 05:09:33,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b23ad47b/6b5c58f732004b5691da17e0f09354d7/FLAG3eb122fab [2024-11-20 05:09:33,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b23ad47b/6b5c58f732004b5691da17e0f09354d7 [2024-11-20 05:09:33,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:09:33,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:09:33,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:09:33,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:09:33,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:09:33,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:09:33" (1/1) ... [2024-11-20 05:09:33,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18feb838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:33, skipping insertion in model container [2024-11-20 05:09:33,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:09:33" (1/1) ... [2024-11-20 05:09:33,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:09:33,958 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-51.i[919,932] [2024-11-20 05:09:34,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:09:34,048 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:09:34,059 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-51.i[919,932] [2024-11-20 05:09:34,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:09:34,125 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:09:34,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:34 WrapperNode [2024-11-20 05:09:34,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:09:34,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:09:34,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:09:34,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:09:34,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:34" (1/1) ... [2024-11-20 05:09:34,146 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:34" (1/1) ... [2024-11-20 05:09:34,184 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-11-20 05:09:34,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:09:34,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:09:34,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:09:34,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:09:34,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:34" (1/1) ... [2024-11-20 05:09:34,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:34" (1/1) ... [2024-11-20 05:09:34,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:34" (1/1) ... [2024-11-20 05:09:34,222 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 05:09:34,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:34" (1/1) ... [2024-11-20 05:09:34,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:34" (1/1) ... [2024-11-20 05:09:34,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:34" (1/1) ... [2024-11-20 05:09:34,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:34" (1/1) ... [2024-11-20 05:09:34,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:34" (1/1) ... [2024-11-20 05:09:34,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:34" (1/1) ... [2024-11-20 05:09:34,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:09:34,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:09:34,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:09:34,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:09:34,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:34" (1/1) ... [2024-11-20 05:09:34,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:09:34,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:09:34,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 05:09:34,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 05:09:34,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:09:34,390 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:09:34,391 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:09:34,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:09:34,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:09:34,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:09:34,475 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:09:34,477 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:09:34,792 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 05:09:34,792 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:09:34,803 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:09:34,803 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 05:09:34,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:09:34 BoogieIcfgContainer [2024-11-20 05:09:34,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:09:34,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:09:34,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:09:34,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:09:34,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:09:33" (1/3) ... [2024-11-20 05:09:34,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed9d29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:09:34, skipping insertion in model container [2024-11-20 05:09:34,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:34" (2/3) ... [2024-11-20 05:09:34,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed9d29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:09:34, skipping insertion in model container [2024-11-20 05:09:34,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:09:34" (3/3) ... [2024-11-20 05:09:34,810 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-51.i [2024-11-20 05:09:34,824 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:09:34,825 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:09:34,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:09:34,879 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;@57db3f20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:09:34,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:09:34,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 05:09:34,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-20 05:09:34,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:09:34,899 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:09:34,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:09:34,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:09:34,907 INFO L85 PathProgramCache]: Analyzing trace with hash 114399864, now seen corresponding path program 1 times [2024-11-20 05:09:34,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:09:34,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379851256] [2024-11-20 05:09:34,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:09:34,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:09:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:09:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:09:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:09:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:09:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:09:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:09:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:09:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:09:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:09:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:09:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:09:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:09:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:09:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:09:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:09:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:09:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:09:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:09:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:09:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:09:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:09:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:09:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 05:09:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 05:09:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 05:09:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 05:09:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 05:09:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 05:09:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 05:09:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 05:09:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 05:09:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 05:09:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 05:09:35,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:09:35,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379851256] [2024-11-20 05:09:35,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379851256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:09:35,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:09:35,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:09:35,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282583979] [2024-11-20 05:09:35,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:09:35,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:09:35,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:09:35,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:09:35,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:09:35,602 INFO L87 Difference]: Start difference. First operand has 96 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 05:09:35,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:09:35,662 INFO L93 Difference]: Finished difference Result 184 states and 326 transitions. [2024-11-20 05:09:35,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:09:35,665 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 204 [2024-11-20 05:09:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:09:35,671 INFO L225 Difference]: With dead ends: 184 [2024-11-20 05:09:35,671 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 05:09:35,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:09:35,677 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:09:35,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:09:35,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 05:09:35,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-20 05:09:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 05:09:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 141 transitions. [2024-11-20 05:09:35,716 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 141 transitions. Word has length 204 [2024-11-20 05:09:35,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:09:35,716 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 141 transitions. [2024-11-20 05:09:35,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 05:09:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 141 transitions. [2024-11-20 05:09:35,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-20 05:09:35,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:09:35,720 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:09:35,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:09:35,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:09:35,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:09:35,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1167317964, now seen corresponding path program 1 times [2024-11-20 05:09:35,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:09:35,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494583025] [2024-11-20 05:09:35,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:09:35,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:09:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:09:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:09:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:09:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:09:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:09:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:09:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:09:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:09:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:09:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:09:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:09:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:09:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:09:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:09:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:09:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:09:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:09:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:09:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:09:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:09:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:09:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:09:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 05:09:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 05:09:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 05:09:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 05:09:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 05:09:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 05:09:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 05:09:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 05:09:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 05:09:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 05:09:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 05:09:36,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:09:36,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494583025] [2024-11-20 05:09:36,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494583025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:09:36,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:09:36,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:09:36,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729870897] [2024-11-20 05:09:36,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:09:36,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:09:36,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:09:36,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:09:36,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:09:36,429 INFO L87 Difference]: Start difference. First operand 91 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 05:09:36,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:09:36,674 INFO L93 Difference]: Finished difference Result 268 states and 418 transitions. [2024-11-20 05:09:36,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:09:36,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-11-20 05:09:36,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:09:36,678 INFO L225 Difference]: With dead ends: 268 [2024-11-20 05:09:36,678 INFO L226 Difference]: Without dead ends: 180 [2024-11-20 05:09:36,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:09:36,680 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 103 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:09:36,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 396 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:09:36,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-20 05:09:36,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 159. [2024-11-20 05:09:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 92 states have internal predecessors, (118), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 05:09:36,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 246 transitions. [2024-11-20 05:09:36,705 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 246 transitions. Word has length 204 [2024-11-20 05:09:36,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:09:36,705 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 246 transitions. [2024-11-20 05:09:36,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 05:09:36,706 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 246 transitions. [2024-11-20 05:09:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-20 05:09:36,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:09:36,708 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:09:36,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:09:36,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:09:36,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:09:36,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1525479022, now seen corresponding path program 1 times [2024-11-20 05:09:36,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:09:36,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231848821] [2024-11-20 05:09:36,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:09:36,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:09:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:09:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:09:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:09:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:09:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:09:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:09:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:09:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:09:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:09:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:09:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:09:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:09:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:09:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:09:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:09:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:09:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:09:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:09:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:09:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:09:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:09:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:09:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 05:09:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 05:09:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 05:09:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 05:09:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 05:09:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 05:09:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 05:09:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 05:09:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 05:09:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 05:09:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 05:09:37,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:09:37,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231848821] [2024-11-20 05:09:37,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231848821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:09:37,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:09:37,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 05:09:37,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310847304] [2024-11-20 05:09:37,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:09:37,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:09:37,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:09:37,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:09:37,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:09:37,206 INFO L87 Difference]: Start difference. First operand 159 states and 246 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 05:09:37,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:09:37,512 INFO L93 Difference]: Finished difference Result 342 states and 529 transitions. [2024-11-20 05:09:37,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 05:09:37,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-11-20 05:09:37,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:09:37,515 INFO L225 Difference]: With dead ends: 342 [2024-11-20 05:09:37,515 INFO L226 Difference]: Without dead ends: 254 [2024-11-20 05:09:37,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:09:37,521 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 116 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:09:37,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 482 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:09:37,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-20 05:09:37,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 245. [2024-11-20 05:09:37,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 145 states have internal predecessors, (190), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-20 05:09:37,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 382 transitions. [2024-11-20 05:09:37,577 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 382 transitions. Word has length 205 [2024-11-20 05:09:37,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:09:37,578 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 382 transitions. [2024-11-20 05:09:37,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 05:09:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 382 transitions. [2024-11-20 05:09:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-20 05:09:37,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:09:37,584 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:09:37,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 05:09:37,584 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:09:37,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:09:37,585 INFO L85 PathProgramCache]: Analyzing trace with hash 523048267, now seen corresponding path program 1 times [2024-11-20 05:09:37,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:09:37,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673771264] [2024-11-20 05:09:37,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:09:37,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:09:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:09:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:09:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:09:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:09:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:09:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:09:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:09:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:09:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:09:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:09:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:09:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:09:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:09:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:09:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:09:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:09:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:09:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:09:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:09:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:09:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:09:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:09:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 05:09:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 05:09:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 05:09:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 05:09:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 05:09:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 05:09:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 05:09:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 05:09:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 05:09:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 05:09:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 05:09:37,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:09:37,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673771264] [2024-11-20 05:09:37,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673771264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:09:37,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:09:37,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:09:37,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898930146] [2024-11-20 05:09:37,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:09:38,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:09:38,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:09:38,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:09:38,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:09:38,002 INFO L87 Difference]: Start difference. First operand 245 states and 382 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 05:09:38,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:09:38,216 INFO L93 Difference]: Finished difference Result 593 states and 930 transitions. [2024-11-20 05:09:38,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:09:38,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 206 [2024-11-20 05:09:38,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:09:38,221 INFO L225 Difference]: With dead ends: 593 [2024-11-20 05:09:38,221 INFO L226 Difference]: Without dead ends: 419 [2024-11-20 05:09:38,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:09:38,225 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 111 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:09:38,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 362 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:09:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-20 05:09:38,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2024-11-20 05:09:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 251 states have (on average 1.3266932270916334) internal successors, (333), 251 states have internal predecessors, (333), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-20 05:09:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 653 transitions. [2024-11-20 05:09:38,310 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 653 transitions. Word has length 206 [2024-11-20 05:09:38,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:09:38,311 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 653 transitions. [2024-11-20 05:09:38,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 05:09:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 653 transitions. [2024-11-20 05:09:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-20 05:09:38,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:09:38,314 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:09:38,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 05:09:38,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:09:38,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:09:38,314 INFO L85 PathProgramCache]: Analyzing trace with hash 130021257, now seen corresponding path program 1 times [2024-11-20 05:09:38,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:09:38,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904848267] [2024-11-20 05:09:38,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:09:38,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:09:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:09:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:09:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:09:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:09:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:09:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:09:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:09:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:09:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:09:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:09:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:09:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:09:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:09:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:09:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:09:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:09:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:09:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:09:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:09:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:09:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:09:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:09:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 05:09:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 05:09:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 05:09:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 05:09:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 05:09:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 05:09:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 05:09:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 05:09:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 05:09:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 05:09:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 05:09:38,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:09:38,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904848267] [2024-11-20 05:09:38,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904848267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:09:38,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:09:38,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:09:38,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110826318] [2024-11-20 05:09:38,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:09:38,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:09:38,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:09:38,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:09:38,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:09:38,512 INFO L87 Difference]: Start difference. First operand 417 states and 653 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 05:09:38,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:09:38,555 INFO L93 Difference]: Finished difference Result 773 states and 1215 transitions. [2024-11-20 05:09:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:09:38,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2024-11-20 05:09:38,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:09:38,560 INFO L225 Difference]: With dead ends: 773 [2024-11-20 05:09:38,560 INFO L226 Difference]: Without dead ends: 427 [2024-11-20 05:09:38,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:09:38,563 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 17 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:09:38,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 285 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:09:38,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-20 05:09:38,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 417. [2024-11-20 05:09:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 251 states have (on average 1.3107569721115537) internal successors, (329), 251 states have internal predecessors, (329), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-20 05:09:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 649 transitions. [2024-11-20 05:09:38,623 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 649 transitions. Word has length 206 [2024-11-20 05:09:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:09:38,625 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 649 transitions. [2024-11-20 05:09:38,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 05:09:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 649 transitions. [2024-11-20 05:09:38,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-20 05:09:38,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:09:38,628 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:09:38,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 05:09:38,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:09:38,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:09:38,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1080240871, now seen corresponding path program 1 times [2024-11-20 05:09:38,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:09:38,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380977901] [2024-11-20 05:09:38,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:09:38,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:09:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:09:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:09:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:09:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:09:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:09:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:09:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:09:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:09:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:09:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:09:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:09:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:09:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:09:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:09:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:09:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:09:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:09:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:09:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:09:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:09:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:09:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:09:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 05:09:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 05:09:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 05:09:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 05:09:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 05:09:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 05:09:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 05:09:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 05:09:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 05:09:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 05:09:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-20 05:09:38,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:09:38,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380977901] [2024-11-20 05:09:38,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380977901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 05:09:38,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449762069] [2024-11-20 05:09:38,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:09:38,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:09:38,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:09:38,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 05:09:38,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 05:09:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:39,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 05:09:39,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:09:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1003 proven. 39 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2024-11-20 05:09:39,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:09:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-20 05:09:39,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449762069] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:09:39,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 05:09:39,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-20 05:09:39,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805740752] [2024-11-20 05:09:39,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 05:09:39,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 05:09:39,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:09:39,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 05:09:39,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:09:39,507 INFO L87 Difference]: Start difference. First operand 417 states and 649 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-20 05:09:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:09:39,729 INFO L93 Difference]: Finished difference Result 805 states and 1227 transitions. [2024-11-20 05:09:39,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 05:09:39,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 207 [2024-11-20 05:09:39,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:09:39,733 INFO L225 Difference]: With dead ends: 805 [2024-11-20 05:09:39,733 INFO L226 Difference]: Without dead ends: 457 [2024-11-20 05:09:39,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 474 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-20 05:09:39,735 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 188 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:09:39,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 236 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:09:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-20 05:09:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 437. [2024-11-20 05:09:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 266 states have (on average 1.2744360902255638) internal successors, (339), 266 states have internal predecessors, (339), 160 states have call successors, (160), 10 states have call predecessors, (160), 10 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-20 05:09:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 659 transitions. [2024-11-20 05:09:39,775 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 659 transitions. Word has length 207 [2024-11-20 05:09:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:09:39,775 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 659 transitions. [2024-11-20 05:09:39,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-20 05:09:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 659 transitions. [2024-11-20 05:09:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-20 05:09:39,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:09:39,777 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:09:39,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 05:09:39,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 05:09:39,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:09:39,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:09:39,979 INFO L85 PathProgramCache]: Analyzing trace with hash 805706601, now seen corresponding path program 1 times [2024-11-20 05:09:39,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:09:39,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246846263] [2024-11-20 05:09:39,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:09:39,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:09:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:09:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:09:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:09:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:09:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:09:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:09:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:09:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:09:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:09:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:09:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:09:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:09:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:09:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:09:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:09:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:09:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:09:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:09:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:09:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:09:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:09:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:09:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 05:09:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 05:09:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 05:09:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 05:09:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 05:09:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 05:09:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 05:09:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 05:09:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 05:09:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 05:09:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 05:09:40,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:09:40,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246846263] [2024-11-20 05:09:40,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246846263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:09:40,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:09:40,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:09:40,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056035422] [2024-11-20 05:09:40,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:09:40,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:09:40,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:09:40,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:09:40,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:09:40,227 INFO L87 Difference]: Start difference. First operand 437 states and 659 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 05:09:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:09:40,386 INFO L93 Difference]: Finished difference Result 1032 states and 1543 transitions. [2024-11-20 05:09:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 05:09:40,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-11-20 05:09:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:09:40,391 INFO L225 Difference]: With dead ends: 1032 [2024-11-20 05:09:40,391 INFO L226 Difference]: Without dead ends: 670 [2024-11-20 05:09:40,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:09:40,393 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 181 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:09:40,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 477 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:09:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-11-20 05:09:40,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 611. [2024-11-20 05:09:40,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 365 states have (on average 1.210958904109589) internal successors, (442), 365 states have internal predecessors, (442), 224 states have call successors, (224), 21 states have call predecessors, (224), 21 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2024-11-20 05:09:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 890 transitions. [2024-11-20 05:09:40,466 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 890 transitions. Word has length 208 [2024-11-20 05:09:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:09:40,467 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 890 transitions. [2024-11-20 05:09:40,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 05:09:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 890 transitions. [2024-11-20 05:09:40,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-20 05:09:40,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:09:40,469 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:09:40,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 05:09:40,470 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:09:40,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:09:40,470 INFO L85 PathProgramCache]: Analyzing trace with hash -737550210, now seen corresponding path program 1 times [2024-11-20 05:09:40,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:09:40,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178770212] [2024-11-20 05:09:40,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:09:40,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:09:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:09:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:09:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:09:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:09:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:09:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:09:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:09:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:09:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:09:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:09:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:09:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:09:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:09:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:09:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:09:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:09:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:09:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:09:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:09:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:09:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:09:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:09:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 05:09:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 05:09:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 05:09:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 05:09:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 05:09:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 05:09:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 05:09:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 05:09:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 05:09:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 05:09:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 144 proven. 36 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2024-11-20 05:09:41,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:09:41,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178770212] [2024-11-20 05:09:41,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178770212] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 05:09:41,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708462156] [2024-11-20 05:09:41,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:09:41,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:09:41,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:09:41,365 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 05:09:41,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 05:09:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:09:41,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 05:09:41,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:09:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1056 proven. 36 refuted. 0 times theorem prover too weak. 892 trivial. 0 not checked. [2024-11-20 05:09:42,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:09:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 144 proven. 39 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2024-11-20 05:09:43,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708462156] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:09:43,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 05:09:43,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 25 [2024-11-20 05:09:43,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363024291] [2024-11-20 05:09:43,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 05:09:43,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-20 05:09:43,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:09:43,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-20 05:09:43,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2024-11-20 05:09:43,158 INFO L87 Difference]: Start difference. First operand 611 states and 890 transitions. Second operand has 25 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 22 states have internal predecessors, (127), 11 states have call successors, (96), 5 states have call predecessors, (96), 10 states have return successors, (96), 14 states have call predecessors, (96), 11 states have call successors, (96) [2024-11-20 05:09:44,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:09:44,801 INFO L93 Difference]: Finished difference Result 1453 states and 2039 transitions. [2024-11-20 05:09:44,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-20 05:09:44,802 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 22 states have internal predecessors, (127), 11 states have call successors, (96), 5 states have call predecessors, (96), 10 states have return successors, (96), 14 states have call predecessors, (96), 11 states have call successors, (96) Word has length 209 [2024-11-20 05:09:44,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:09:44,807 INFO L225 Difference]: With dead ends: 1453 [2024-11-20 05:09:44,807 INFO L226 Difference]: Without dead ends: 910 [2024-11-20 05:09:44,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=597, Invalid=1659, Unknown=0, NotChecked=0, Total=2256 [2024-11-20 05:09:44,809 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 517 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:09:44,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 754 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 05:09:44,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-20 05:09:44,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 829. [2024-11-20 05:09:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 500 states have (on average 1.174) internal successors, (587), 503 states have internal predecessors, (587), 287 states have call successors, (287), 41 states have call predecessors, (287), 41 states have return successors, (287), 284 states have call predecessors, (287), 287 states have call successors, (287) [2024-11-20 05:09:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1161 transitions. [2024-11-20 05:09:44,869 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1161 transitions. Word has length 209 [2024-11-20 05:09:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:09:44,869 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1161 transitions. [2024-11-20 05:09:44,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 22 states have internal predecessors, (127), 11 states have call successors, (96), 5 states have call predecessors, (96), 10 states have return successors, (96), 14 states have call predecessors, (96), 11 states have call successors, (96) [2024-11-20 05:09:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1161 transitions. [2024-11-20 05:09:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-20 05:09:44,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:09:44,871 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:09:44,879 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-11-20 05:09:45,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-20 05:09:45,072 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:09:45,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:09:45,073 INFO L85 PathProgramCache]: Analyzing trace with hash -675510596, now seen corresponding path program 1 times [2024-11-20 05:09:45,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:09:45,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357573276] [2024-11-20 05:09:45,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:09:45,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:09:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 05:09:45,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [209298513] [2024-11-20 05:09:45,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:09:45,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:09:45,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:09:45,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 05:09:45,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 05:09:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:09:45,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 05:09:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:09:45,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 05:09:45,364 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 05:09:45,365 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:09:45,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 05:09:45,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:09:45,569 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:09:45,684 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:09:45,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:09:45 BoogieIcfgContainer [2024-11-20 05:09:45,686 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:09:45,687 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:09:45,687 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:09:45,687 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:09:45,687 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:09:34" (3/4) ... [2024-11-20 05:09:45,689 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 05:09:45,690 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:09:45,690 INFO L158 Benchmark]: Toolchain (without parser) took 11973.60ms. Allocated memory was 144.7MB in the beginning and 427.8MB in the end (delta: 283.1MB). Free memory was 74.1MB in the beginning and 379.5MB in the end (delta: -305.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:09:45,691 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 144.7MB. Free memory is still 96.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:09:45,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.80ms. Allocated memory was 144.7MB in the beginning and 205.5MB in the end (delta: 60.8MB). Free memory was 73.9MB in the beginning and 172.1MB in the end (delta: -98.1MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-20 05:09:45,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.69ms. Allocated memory is still 205.5MB. Free memory was 172.1MB in the beginning and 169.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 05:09:45,691 INFO L158 Benchmark]: Boogie Preprocessor took 80.79ms. Allocated memory is still 205.5MB. Free memory was 169.0MB in the beginning and 164.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 05:09:45,691 INFO L158 Benchmark]: RCFGBuilder took 532.62ms. Allocated memory is still 205.5MB. Free memory was 164.8MB in the beginning and 139.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-20 05:09:45,691 INFO L158 Benchmark]: TraceAbstraction took 10881.12ms. Allocated memory was 205.5MB in the beginning and 427.8MB in the end (delta: 222.3MB). Free memory was 138.6MB in the beginning and 380.6MB in the end (delta: -242.0MB). Peak memory consumption was 217.3MB. Max. memory is 16.1GB. [2024-11-20 05:09:45,691 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 427.8MB. Free memory was 380.6MB in the beginning and 379.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:09:45,692 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 144.7MB. Free memory is still 96.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.80ms. Allocated memory was 144.7MB in the beginning and 205.5MB in the end (delta: 60.8MB). Free memory was 73.9MB in the beginning and 172.1MB in the end (delta: -98.1MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.69ms. Allocated memory is still 205.5MB. Free memory was 172.1MB in the beginning and 169.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.79ms. Allocated memory is still 205.5MB. Free memory was 169.0MB in the beginning and 164.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 532.62ms. Allocated memory is still 205.5MB. Free memory was 164.8MB in the beginning and 139.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10881.12ms. Allocated memory was 205.5MB in the beginning and 427.8MB in the end (delta: 222.3MB). Free memory was 138.6MB in the beginning and 380.6MB in the end (delta: -242.0MB). Peak memory consumption was 217.3MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 427.8MB. Free memory was 380.6MB in the beginning and 379.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 206, overapproximation of someBinaryFLOATComparisonOperation at line 194, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] float var_1_25 = -0.575; [L41] signed char var_1_27 = 5; [L42] signed char var_1_28 = 1; [L43] float var_1_30 = 10.8; [L44] float var_1_31 = 49.2; [L45] float var_1_32 = 0.4; [L46] unsigned char var_1_33 = 10; [L47] unsigned char var_1_37 = 64; [L48] signed char var_1_38 = -8; [L49] unsigned short int var_1_40 = 200; [L50] unsigned long int var_1_42 = 2; [L51] unsigned long int var_1_44 = 10; [L52] unsigned short int var_1_45 = 16; [L53] unsigned char last_1_var_1_1 = 128; [L54] unsigned long int last_1_var_1_12 = 8; [L55] double last_1_var_1_17 = 256.8; [L56] unsigned char last_1_var_1_21 = 1; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L210] isInitial = 1 [L211] FCALL initially() [L212] COND TRUE 1 [L213] CALL updateLastVariables() [L200] last_1_var_1_1 = var_1_1 [L201] last_1_var_1_12 = var_1_12 [L202] last_1_var_1_17 = var_1_17 [L203] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L213] RET updateLastVariables() [L214] CALL updateVariables() [L148] var_1_4 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L149] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L150] var_1_5 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=2, var_1_8=-10, var_1_9=5] [L151] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=2, var_1_8=-10, var_1_9=5] [L152] var_1_7 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_8=-10, var_1_9=5] [L153] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_8=-10, var_1_9=5] [L154] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=5] [L154] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=5] [L155] var_1_9 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L156] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L157] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L157] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L158] var_1_10 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L159] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L160] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L160] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L161] var_1_11 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L162] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L163] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L163] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L164] var_1_13 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L165] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L166] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L166] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L167] var_1_15 = __VERIFIER_nondet_ulong() [L168] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L168] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L169] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L169] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L170] var_1_18 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && 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_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L171] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && 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_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L172] var_1_22 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L173] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L174] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L174] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L175] var_1_23 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L176] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L177] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L177] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L178] var_1_24 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L179] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L180] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L180] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L181] var_1_27 = __VERIFIER_nondet_char() [L182] CALL assume_abort_if_not(var_1_27 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L182] RET assume_abort_if_not(var_1_27 >= -128) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L183] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L183] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L184] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L184] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L185] var_1_28 = __VERIFIER_nondet_char() [L186] CALL assume_abort_if_not(var_1_28 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L186] RET assume_abort_if_not(var_1_28 >= -128) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L187] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L187] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L188] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L188] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L189] var_1_30 = __VERIFIER_nondet_float() [L190] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L190] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L191] var_1_31 = __VERIFIER_nondet_float() [L192] CALL assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L192] RET assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L193] var_1_32 = __VERIFIER_nondet_float() [L194] CALL assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L194] RET assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L195] var_1_37 = __VERIFIER_nondet_uchar() [L196] CALL assume_abort_if_not(var_1_37 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L196] RET assume_abort_if_not(var_1_37 >= 64) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L197] CALL assume_abort_if_not(var_1_37 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L197] RET assume_abort_if_not(var_1_37 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L214] RET updateVariables() [L215] CALL step() [L60] COND FALSE !((var_1_1 % ((((var_1_27) > (var_1_28)) ? (var_1_27) : (var_1_28)))) > var_1_1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L63] COND TRUE var_1_32 < ((((var_1_30) > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) ? (var_1_30) : (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) [L64] var_1_33 = ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L70] var_1_38 = var_1_11 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L72] var_1_40 = var_1_11 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L78] COND FALSE !(((((1.000000095E7f) < 0 ) ? -(1.000000095E7f) : (1.000000095E7f))) < ((9.9999999999996E12f - var_1_31) / var_1_22)) [L83] var_1_42 = 100000u VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=10, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L85] var_1_44 = (((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) + (((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < 0 ) ? -((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) : ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L86] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=16, var_1_7=1, var_1_8=-10, var_1_9=15] [L89] COND TRUE var_1_19 > ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) [L90] var_1_45 = var_1_11 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=-10, var_1_9=15] [L95] unsigned char stepLocal_3 = ((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=0, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=-10, var_1_9=15] [L96] COND TRUE last_1_var_1_21 || stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=-10, var_1_9=15] [L97] COND FALSE !(var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) [L100] var_1_19 = var_1_11 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=0, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=-10, var_1_9=15] [L105] unsigned long int stepLocal_1 = last_1_var_1_12; [L106] unsigned long int stepLocal_0 = 32u; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=0, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=-10, var_1_9=15] [L107] COND TRUE stepLocal_0 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_1=8, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=0, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=-10, var_1_9=15] [L108] COND TRUE stepLocal_1 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=0, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=-10, var_1_9=15] [L109] COND FALSE !((var_1_4 - var_1_5) >= last_1_var_1_17) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=0, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=-10, var_1_9=15] [L116] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=0, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=-10, var_1_9=15] [L119] COND TRUE ! (var_1_17 > var_1_5) [L120] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=0, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=14, var_1_9=15] [L124] unsigned long int stepLocal_4 = var_1_19; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=0, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=0, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=14, var_1_9=15] [L125] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L136] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=0, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=14, var_1_9=15] [L138] unsigned char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_2=0, stepLocal_4=0, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=14, var_1_9=15] [L139] COND FALSE !(var_1_21 && stepLocal_2) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=0, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=14, var_1_9=15] [L142] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=0, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=14, var_1_9=15] [L215] RET step() [L216] CALL, EXPR property() [L206-L207] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=14, var_1_9=15] [L216] RET, EXPR property() [L216] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=14, var_1_9=15] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=14, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-128, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=1, var_1_8=14, var_1_9=15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 9, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1253 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1233 mSDsluCounter, 3133 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1989 mSDsCounter, 825 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1245 IncrementalHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 825 mSolverCounterUnsat, 1144 mSDtfsCounter, 1245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1450 GetRequests, 1379 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=829occurred in iteration=8, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 202 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2483 NumberOfCodeBlocks, 2483 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2469 ConstructedInterpolants, 0 QuantifiedInterpolants, 7503 SizeOfPredicates, 4 NumberOfNonLiveVariables, 939 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 23580/23808 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 05:09:45,734 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-ps-ci_file-51.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 5fae3db68adc0ffe998fc93858a245ffb30205c57f234c7f9849920ee7dba257 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:09:48,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:09:48,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 05:09:48,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:09:48,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:09:48,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:09:48,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:09:48,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:09:48,127 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:09:48,127 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:09:48,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:09:48,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:09:48,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:09:48,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:09:48,129 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:09:48,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:09:48,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:09:48,132 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:09:48,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:09:48,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:09:48,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:09:48,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:09:48,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:09:48,136 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 05:09:48,136 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 05:09:48,136 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:09:48,136 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 05:09:48,136 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:09:48,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:09:48,137 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:09:48,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:09:48,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:09:48,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:09:48,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:09:48,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:09:48,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:09:48,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:09:48,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:09:48,140 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 05:09:48,140 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 05:09:48,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:09:48,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:09:48,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:09:48,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:09:48,141 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 -> 5fae3db68adc0ffe998fc93858a245ffb30205c57f234c7f9849920ee7dba257 [2024-11-20 05:09:48,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:09:48,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:09:48,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:09:48,514 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:09:48,514 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:09:48,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-51.i [2024-11-20 05:09:50,059 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:09:50,292 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:09:50,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-51.i [2024-11-20 05:09:50,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d64c726c/12b68aa0a6f24da1bb41e92d96cf3878/FLAGaece2635f [2024-11-20 05:09:50,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d64c726c/12b68aa0a6f24da1bb41e92d96cf3878 [2024-11-20 05:09:50,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:09:50,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:09:50,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:09:50,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:09:50,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:09:50,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:09:50" (1/1) ... [2024-11-20 05:09:50,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d8b98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:50, skipping insertion in model container [2024-11-20 05:09:50,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:09:50" (1/1) ... [2024-11-20 05:09:50,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:09:50,515 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-51.i[919,932] [2024-11-20 05:09:50,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:09:50,614 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:09:50,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-51.i[919,932] [2024-11-20 05:09:50,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:09:50,698 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:09:50,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:50 WrapperNode [2024-11-20 05:09:50,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:09:50,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:09:50,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:09:50,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:09:50,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:50" (1/1) ... [2024-11-20 05:09:50,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:50" (1/1) ... [2024-11-20 05:09:50,758 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-20 05:09:50,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:09:50,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:09:50,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:09:50,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:09:50,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:50" (1/1) ... [2024-11-20 05:09:50,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:50" (1/1) ... [2024-11-20 05:09:50,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:50" (1/1) ... [2024-11-20 05:09:50,790 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 05:09:50,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:50" (1/1) ... [2024-11-20 05:09:50,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:50" (1/1) ... [2024-11-20 05:09:50,804 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:50" (1/1) ... [2024-11-20 05:09:50,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:50" (1/1) ... [2024-11-20 05:09:50,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:50" (1/1) ... [2024-11-20 05:09:50,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:50" (1/1) ... [2024-11-20 05:09:50,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:09:50,823 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:09:50,823 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:09:50,823 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:09:50,824 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:50" (1/1) ... [2024-11-20 05:09:50,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:09:50,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:09:50,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 05:09:50,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 05:09:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:09:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 05:09:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:09:50,884 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:09:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:09:50,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:09:50,999 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:09:51,000 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:10:14,110 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 05:10:14,110 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:10:14,125 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:10:14,125 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 05:10:14,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:10:14 BoogieIcfgContainer [2024-11-20 05:10:14,126 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:10:14,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:10:14,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:10:14,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:10:14,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:09:50" (1/3) ... [2024-11-20 05:10:14,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38499151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:10:14, skipping insertion in model container [2024-11-20 05:10:14,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:50" (2/3) ... [2024-11-20 05:10:14,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38499151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:10:14, skipping insertion in model container [2024-11-20 05:10:14,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:10:14" (3/3) ... [2024-11-20 05:10:14,133 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-51.i [2024-11-20 05:10:14,148 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:10:14,149 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:10:14,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:10:14,207 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;@4956d26c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:10:14,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:10:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 05:10:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-20 05:10:14,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:10:14,224 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:10:14,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:10:14,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:10:14,229 INFO L85 PathProgramCache]: Analyzing trace with hash 114399864, now seen corresponding path program 1 times [2024-11-20 05:10:14,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:10:14,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584528724] [2024-11-20 05:10:14,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:10:14,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:10:14,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:10:14,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:10:14,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 05:10:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:15,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 05:10:15,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:10:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2024-11-20 05:10:15,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:10:15,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:10:15,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584528724] [2024-11-20 05:10:15,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584528724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:10:15,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:10:15,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:10:15,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607140266] [2024-11-20 05:10:15,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:10:15,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:10:15,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:10:15,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:10:15,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:10:15,804 INFO L87 Difference]: Start difference. First operand has 96 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 05:10:15,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:10:15,826 INFO L93 Difference]: Finished difference Result 184 states and 326 transitions. [2024-11-20 05:10:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:10:15,828 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 204 [2024-11-20 05:10:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:10:15,833 INFO L225 Difference]: With dead ends: 184 [2024-11-20 05:10:15,833 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 05:10:15,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:10:15,838 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:10:15,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:10:15,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 05:10:15,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-20 05:10:15,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 05:10:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 140 transitions. [2024-11-20 05:10:15,872 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 140 transitions. Word has length 204 [2024-11-20 05:10:15,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:10:15,872 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 140 transitions. [2024-11-20 05:10:15,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 05:10:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2024-11-20 05:10:15,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-20 05:10:15,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:10:15,875 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:10:15,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 05:10:16,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:10:16,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:10:16,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:10:16,081 INFO L85 PathProgramCache]: Analyzing trace with hash -744616138, now seen corresponding path program 1 times [2024-11-20 05:10:16,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:10:16,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012947341] [2024-11-20 05:10:16,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:10:16,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:10:16,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:10:16,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:10:16,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 05:10:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:17,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 05:10:17,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:10:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1003 proven. 39 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2024-11-20 05:10:21,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:10:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-20 05:10:25,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:10:25,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012947341] [2024-11-20 05:10:25,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012947341] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:10:25,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 05:10:25,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-20 05:10:25,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469990304] [2024-11-20 05:10:25,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 05:10:25,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 05:10:25,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:10:25,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 05:10:25,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:10:25,167 INFO L87 Difference]: Start difference. First operand 91 states and 140 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-20 05:10:33,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:10:37,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:10:41,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:10:45,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:10:49,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:10:53,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:10:53,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:10:53,632 INFO L93 Difference]: Finished difference Result 187 states and 284 transitions. [2024-11-20 05:10:53,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 05:10:53,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 204 [2024-11-20 05:10:53,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:10:53,728 INFO L225 Difference]: With dead ends: 187 [2024-11-20 05:10:53,728 INFO L226 Difference]: Without dead ends: 99 [2024-11-20 05:10:53,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-20 05:10:53,731 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 75 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 8 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.9s IncrementalHoareTripleChecker+Time [2024-11-20 05:10:53,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 237 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 178 Invalid, 6 Unknown, 0 Unchecked, 27.9s Time] [2024-11-20 05:10:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-20 05:10:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2024-11-20 05:10:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 05:10:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2024-11-20 05:10:53,751 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 204 [2024-11-20 05:10:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:10:53,752 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2024-11-20 05:10:53,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-20 05:10:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2024-11-20 05:10:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-20 05:10:53,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:10:53,759 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:10:53,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 05:10:53,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:10:53,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:10:53,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:10:53,960 INFO L85 PathProgramCache]: Analyzing trace with hash 868501552, now seen corresponding path program 1 times [2024-11-20 05:10:53,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:10:53,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509608720] [2024-11-20 05:10:53,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:10:53,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:10:53,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:10:53,964 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:10:53,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 05:10:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:10:55,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 05:10:55,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:11:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 05:11:01,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:11:01,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:11:01,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509608720] [2024-11-20 05:11:01,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509608720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:11:01,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:11:01,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:11:01,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295068629] [2024-11-20 05:11:01,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:11:01,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:11:01,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:11:01,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:11:01,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:11:01,973 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 05:11:06,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:11:10,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []