./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-pe-ci_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-pe-ci_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a67eb2296c14f3c2c0352d32dbf94d4653f0c910afa8f9438196c7a49cf42079 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:03:50,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:03:50,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 09:03:50,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:03:50,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:03:50,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:03:50,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:03:50,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:03:50,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:03:50,674 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:03:50,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:03:50,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:03:50,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:03:50,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:03:50,676 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:03:50,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:03:50,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:03:50,677 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:03:50,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 09:03:50,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:03:50,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:03:50,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:03:50,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:03:50,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:03:50,679 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:03:50,679 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:03:50,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:03:50,680 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:03:50,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:03:50,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:03:50,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:03:50,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:03:50,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:03:50,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:03:50,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:03:50,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:03:50,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 09:03:50,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 09:03:50,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:03:50,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:03:50,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:03:50,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:03:50,684 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 -> a67eb2296c14f3c2c0352d32dbf94d4653f0c910afa8f9438196c7a49cf42079 [2024-10-14 09:03:50,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:03:50,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:03:50,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:03:50,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:03:50,913 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:03:50,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-38.i [2024-10-14 09:03:52,499 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:03:52,669 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:03:52,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-38.i [2024-10-14 09:03:52,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f69a053/19a995ca55df481b9da7a00b7460304a/FLAG575851711 [2024-10-14 09:03:52,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f69a053/19a995ca55df481b9da7a00b7460304a [2024-10-14 09:03:52,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:03:52,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:03:52,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:03:52,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:03:52,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:03:52,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:03:52" (1/1) ... [2024-10-14 09:03:52,717 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@410875f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:03:52, skipping insertion in model container [2024-10-14 09:03:52,717 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:03:52" (1/1) ... [2024-10-14 09:03:52,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:03:52,885 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-38.i[919,932] [2024-10-14 09:03:52,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:03:52,971 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:03:52,983 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-38.i[919,932] [2024-10-14 09:03:53,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:03:53,111 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:03:53,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:03:53 WrapperNode [2024-10-14 09:03:53,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:03:53,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:03:53,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:03:53,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:03:53,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:03:53" (1/1) ... [2024-10-14 09:03:53,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:03:53" (1/1) ... [2024-10-14 09:03:53,191 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2024-10-14 09:03:53,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:03:53,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:03:53,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:03:53,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:03:53,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:03:53" (1/1) ... [2024-10-14 09:03:53,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:03:53" (1/1) ... [2024-10-14 09:03:53,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:03:53" (1/1) ... [2024-10-14 09:03:53,239 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 09:03:53,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:03:53" (1/1) ... [2024-10-14 09:03:53,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:03:53" (1/1) ... [2024-10-14 09:03:53,250 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:03:53" (1/1) ... [2024-10-14 09:03:53,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:03:53" (1/1) ... [2024-10-14 09:03:53,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:03:53" (1/1) ... [2024-10-14 09:03:53,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:03:53" (1/1) ... [2024-10-14 09:03:53,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:03:53,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:03:53,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:03:53,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:03:53,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:03:53" (1/1) ... [2024-10-14 09:03:53,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:03:53,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:03:53,291 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 09:03:53,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 09:03:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:03:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:03:53,355 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:03:53,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 09:03:53,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:03:53,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:03:53,443 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:03:53,445 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:03:53,788 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 09:03:53,788 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:03:53,813 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:03:53,813 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:03:53,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:03:53 BoogieIcfgContainer [2024-10-14 09:03:53,814 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:03:53,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:03:53,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:03:53,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:03:53,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:03:52" (1/3) ... [2024-10-14 09:03:53,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c04914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:03:53, skipping insertion in model container [2024-10-14 09:03:53,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:03:53" (2/3) ... [2024-10-14 09:03:53,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c04914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:03:53, skipping insertion in model container [2024-10-14 09:03:53,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:03:53" (3/3) ... [2024-10-14 09:03:53,821 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-38.i [2024-10-14 09:03:53,835 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:03:53,835 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:03:53,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:03:53,889 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;@66d6158d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:03:53,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:03:53,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 59 states have internal predecessors, (88), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 09:03:53,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-14 09:03:53,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:03:53,906 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:03:53,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:03:53,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:03:53,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1758807022, now seen corresponding path program 1 times [2024-10-14 09:03:53,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:03:53,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629222018] [2024-10-14 09:03:53,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:03:53,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:03:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:03:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:03:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:03:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:03:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:03:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:03:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:03:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:03:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:03:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:03:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:03:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:03:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:03:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:03:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:03:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:03:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 09:03:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:03:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:03:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:03:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:03:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:03:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:03:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:03:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:03:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 09:03:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 09:03:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 09:03:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 09:03:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 09:03:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:03:54,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:03:54,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629222018] [2024-10-14 09:03:54,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629222018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:03:54,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:03:54,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:03:54,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405439413] [2024-10-14 09:03:54,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:03:54,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:03:54,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:03:54,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:03:54,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:03:54,415 INFO L87 Difference]: Start difference. First operand has 91 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 59 states have internal predecessors, (88), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-14 09:03:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:03:54,459 INFO L93 Difference]: Finished difference Result 179 states and 324 transitions. [2024-10-14 09:03:54,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:03:54,462 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 188 [2024-10-14 09:03:54,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:03:54,470 INFO L225 Difference]: With dead ends: 179 [2024-10-14 09:03:54,471 INFO L226 Difference]: Without dead ends: 89 [2024-10-14 09:03:54,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:03:54,479 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:03:54,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:03:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-14 09:03:54,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-14 09:03:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 57 states have internal predecessors, (82), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 09:03:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 142 transitions. [2024-10-14 09:03:54,551 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 142 transitions. Word has length 188 [2024-10-14 09:03:54,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:03:54,557 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 142 transitions. [2024-10-14 09:03:54,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-14 09:03:54,558 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2024-10-14 09:03:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-14 09:03:54,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:03:54,566 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:03:54,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 09:03:54,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:03:54,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:03:54,571 INFO L85 PathProgramCache]: Analyzing trace with hash -231701602, now seen corresponding path program 1 times [2024-10-14 09:03:54,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:03:54,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286697812] [2024-10-14 09:03:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:03:54,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:03:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:03:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:03:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:03:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:03:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:03:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:03:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:03:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:03:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:03:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:03:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:03:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:03:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:03:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:03:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:03:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:03:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 09:03:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:03:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:03:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:03:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:03:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:54,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:03:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:03:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:03:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:03:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 09:03:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 09:03:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 09:03:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 09:03:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 09:03:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:03:55,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:03:55,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286697812] [2024-10-14 09:03:55,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286697812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:03:55,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:03:55,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:03:55,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889631194] [2024-10-14 09:03:55,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:03:55,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:03:55,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:03:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:03:55,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:03:55,028 INFO L87 Difference]: Start difference. First operand 89 states and 142 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:03:55,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:03:55,101 INFO L93 Difference]: Finished difference Result 178 states and 285 transitions. [2024-10-14 09:03:55,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:03:55,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2024-10-14 09:03:55,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:03:55,107 INFO L225 Difference]: With dead ends: 178 [2024-10-14 09:03:55,107 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 09:03:55,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:03:55,111 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:03:55,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:03:55,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 09:03:55,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-14 09:03:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 09:03:55,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 143 transitions. [2024-10-14 09:03:55,129 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 143 transitions. Word has length 188 [2024-10-14 09:03:55,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:03:55,133 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 143 transitions. [2024-10-14 09:03:55,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:03:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 143 transitions. [2024-10-14 09:03:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-14 09:03:55,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:03:55,138 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:03:55,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 09:03:55,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:03:55,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:03:55,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1534194276, now seen corresponding path program 1 times [2024-10-14 09:03:55,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:03:55,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741626765] [2024-10-14 09:03:55,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:03:55,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:03:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:03:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:03:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:03:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:03:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:03:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:03:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:03:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:03:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:03:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:03:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:03:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:03:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:03:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:03:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:03:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:03:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 09:03:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:03:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:03:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:03:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:03:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:03:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:03:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:03:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:03:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 09:03:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 09:03:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 09:03:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 09:03:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 09:03:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:03:55,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:03:55,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741626765] [2024-10-14 09:03:55,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741626765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:03:55,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:03:55,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:03:55,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808933143] [2024-10-14 09:03:55,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:03:55,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:03:55,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:03:55,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:03:55,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:03:55,595 INFO L87 Difference]: Start difference. First operand 90 states and 143 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:03:55,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:03:55,845 INFO L93 Difference]: Finished difference Result 352 states and 560 transitions. [2024-10-14 09:03:55,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:03:55,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 189 [2024-10-14 09:03:55,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:03:55,853 INFO L225 Difference]: With dead ends: 352 [2024-10-14 09:03:55,853 INFO L226 Difference]: Without dead ends: 263 [2024-10-14 09:03:55,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:03:55,855 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 394 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:03:55,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 527 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:03:55,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-14 09:03:55,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 177. [2024-10-14 09:03:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 states have internal predecessors, (163), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 09:03:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 283 transitions. [2024-10-14 09:03:55,908 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 283 transitions. Word has length 189 [2024-10-14 09:03:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:03:55,911 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 283 transitions. [2024-10-14 09:03:55,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:03:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 283 transitions. [2024-10-14 09:03:55,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-14 09:03:55,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:03:55,917 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:03:55,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 09:03:55,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:03:55,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:03:55,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1083434098, now seen corresponding path program 1 times [2024-10-14 09:03:55,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:03:55,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192556811] [2024-10-14 09:03:55,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:03:55,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:03:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:03:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:03:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:03:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:03:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:03:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:03:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:03:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:03:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:03:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:03:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:03:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:03:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:03:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:03:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:03:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:03:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 09:03:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:03:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:03:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:03:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:03:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:03:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:03:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:03:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:03:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 09:03:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 09:03:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 09:03:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 09:03:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 09:03:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:03:56,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:03:56,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192556811] [2024-10-14 09:03:56,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192556811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:03:56,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:03:56,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:03:56,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987350285] [2024-10-14 09:03:56,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:03:56,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:03:56,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:03:56,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:03:56,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:03:56,272 INFO L87 Difference]: Start difference. First operand 177 states and 283 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:03:56,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:03:56,659 INFO L93 Difference]: Finished difference Result 595 states and 955 transitions. [2024-10-14 09:03:56,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:03:56,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2024-10-14 09:03:56,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:03:56,663 INFO L225 Difference]: With dead ends: 595 [2024-10-14 09:03:56,663 INFO L226 Difference]: Without dead ends: 419 [2024-10-14 09:03:56,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:03:56,670 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 145 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:03:56,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 540 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 09:03:56,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-14 09:03:56,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 353. [2024-10-14 09:03:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 228 states have (on average 1.4298245614035088) internal successors, (326), 228 states have internal predecessors, (326), 120 states have call successors, (120), 4 states have call predecessors, (120), 4 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-14 09:03:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 566 transitions. [2024-10-14 09:03:56,734 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 566 transitions. Word has length 190 [2024-10-14 09:03:56,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:03:56,736 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 566 transitions. [2024-10-14 09:03:56,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:03:56,736 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 566 transitions. [2024-10-14 09:03:56,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-14 09:03:56,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:03:56,738 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:03:56,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 09:03:56,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:03:56,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:03:56,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1506135924, now seen corresponding path program 1 times [2024-10-14 09:03:56,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:03:56,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442643277] [2024-10-14 09:03:56,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:03:56,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:03:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:03:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:03:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:03:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:03:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:03:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:03:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:03:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:03:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:03:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:03:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:03:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:03:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:03:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:03:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:03:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:03:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 09:03:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:03:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:03:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:03:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:03:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:03:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:03:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:03:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:03:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 09:03:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 09:03:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 09:03:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 09:03:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 09:03:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-14 09:03:57,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:03:57,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442643277] [2024-10-14 09:03:57,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442643277] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:03:57,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181280682] [2024-10-14 09:03:57,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:03:57,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:03:57,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:03:57,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:03:57,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 09:03:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:57,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 09:03:57,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:03:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-10-14 09:03:57,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:03:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-14 09:03:57,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181280682] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:03:57,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:03:57,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 9 [2024-10-14 09:03:57,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120390112] [2024-10-14 09:03:57,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:03:57,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 09:03:57,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:03:57,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 09:03:57,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 09:03:57,636 INFO L87 Difference]: Start difference. First operand 353 states and 566 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (78), 3 states have call predecessors, (78), 3 states have call successors, (78) [2024-10-14 09:03:57,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:03:57,977 INFO L93 Difference]: Finished difference Result 626 states and 975 transitions. [2024-10-14 09:03:57,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 09:03:57,978 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (78), 3 states have call predecessors, (78), 3 states have call successors, (78) Word has length 190 [2024-10-14 09:03:57,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:03:57,981 INFO L225 Difference]: With dead ends: 626 [2024-10-14 09:03:57,981 INFO L226 Difference]: Without dead ends: 274 [2024-10-14 09:03:57,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-10-14 09:03:57,983 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 118 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:03:57,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 282 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:03:57,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-14 09:03:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 260. [2024-10-14 09:03:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 160 states have (on average 1.3) internal successors, (208), 160 states have internal predecessors, (208), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 09:03:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2024-10-14 09:03:58,012 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 190 [2024-10-14 09:03:58,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:03:58,013 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2024-10-14 09:03:58,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (78), 3 states have call predecessors, (78), 3 states have call successors, (78) [2024-10-14 09:03:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2024-10-14 09:03:58,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-14 09:03:58,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:03:58,015 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:03:58,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 09:03:58,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:03:58,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:03:58,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:03:58,220 INFO L85 PathProgramCache]: Analyzing trace with hash 466287269, now seen corresponding path program 1 times [2024-10-14 09:03:58,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:03:58,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412207084] [2024-10-14 09:03:58,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:03:58,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:03:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:03:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:03:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:03:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:03:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:03:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:03:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:03:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:03:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:03:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:03:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:03:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:03:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:03:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:03:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:03:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:03:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 09:03:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:03:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:03:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:03:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:03:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:03:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:03:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:03:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:03:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 09:03:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 09:03:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 09:03:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 09:03:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 09:03:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:03:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:03:58,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:03:58,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412207084] [2024-10-14 09:03:58,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412207084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:03:58,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:03:58,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:03:58,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385744705] [2024-10-14 09:03:58,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:03:58,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:03:58,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:03:58,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:03:58,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:03:58,473 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:03:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:03:58,701 INFO L93 Difference]: Finished difference Result 581 states and 862 transitions. [2024-10-14 09:03:58,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 09:03:58,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2024-10-14 09:03:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:03:58,704 INFO L225 Difference]: With dead ends: 581 [2024-10-14 09:03:58,704 INFO L226 Difference]: Without dead ends: 352 [2024-10-14 09:03:58,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 09:03:58,705 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 243 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:03:58,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 674 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:03:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-14 09:03:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 336. [2024-10-14 09:03:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 212 states have (on average 1.3066037735849056) internal successors, (277), 214 states have internal predecessors, (277), 110 states have call successors, (110), 13 states have call predecessors, (110), 13 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-14 09:03:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 497 transitions. [2024-10-14 09:03:58,737 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 497 transitions. Word has length 191 [2024-10-14 09:03:58,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:03:58,737 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 497 transitions. [2024-10-14 09:03:58,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:03:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 497 transitions. [2024-10-14 09:03:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-14 09:03:58,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:03:58,739 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:03:58,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 09:03:58,739 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:03:58,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:03:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1246360521, now seen corresponding path program 1 times [2024-10-14 09:03:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:03:58,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084229924] [2024-10-14 09:03:58,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:03:58,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:03:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:03:58,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081852988] [2024-10-14 09:03:58,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:03:58,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:03:58,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:03:58,843 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:03:58,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 09:03:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:03:58,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 09:03:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:03:59,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 09:03:59,165 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 09:03:59,166 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 09:03:59,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 09:03:59,371 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,SelfDestructingSolverStorable6 [2024-10-14 09:03:59,375 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:03:59,464 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 09:03:59,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:03:59 BoogieIcfgContainer [2024-10-14 09:03:59,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 09:03:59,467 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 09:03:59,467 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 09:03:59,467 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 09:03:59,467 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:03:53" (3/4) ... [2024-10-14 09:03:59,469 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 09:03:59,470 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 09:03:59,470 INFO L158 Benchmark]: Toolchain (without parser) took 6763.31ms. Allocated memory was 159.4MB in the beginning and 337.6MB in the end (delta: 178.3MB). Free memory was 86.9MB in the beginning and 243.4MB in the end (delta: -156.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 09:03:59,470 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:03:59,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.60ms. Allocated memory was 159.4MB in the beginning and 260.0MB in the end (delta: 100.7MB). Free memory was 86.7MB in the beginning and 229.4MB in the end (delta: -142.7MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2024-10-14 09:03:59,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.18ms. Allocated memory is still 260.0MB. Free memory was 229.4MB in the beginning and 225.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 09:03:59,471 INFO L158 Benchmark]: Boogie Preprocessor took 69.01ms. Allocated memory is still 260.0MB. Free memory was 225.7MB in the beginning and 222.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 09:03:59,471 INFO L158 Benchmark]: RCFGBuilder took 552.45ms. Allocated memory is still 260.0MB. Free memory was 222.5MB in the beginning and 193.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-14 09:03:59,472 INFO L158 Benchmark]: TraceAbstraction took 5650.71ms. Allocated memory was 260.0MB in the beginning and 337.6MB in the end (delta: 77.6MB). Free memory was 193.2MB in the beginning and 243.4MB in the end (delta: -50.2MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2024-10-14 09:03:59,472 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 337.6MB. Free memory is still 243.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:03:59,473 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 159.4MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.60ms. Allocated memory was 159.4MB in the beginning and 260.0MB in the end (delta: 100.7MB). Free memory was 86.7MB in the beginning and 229.4MB in the end (delta: -142.7MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.18ms. Allocated memory is still 260.0MB. Free memory was 229.4MB in the beginning and 225.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.01ms. Allocated memory is still 260.0MB. Free memory was 225.7MB in the beginning and 222.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 552.45ms. Allocated memory is still 260.0MB. Free memory was 222.5MB in the beginning and 193.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5650.71ms. Allocated memory was 260.0MB in the beginning and 337.6MB in the end (delta: 77.6MB). Free memory was 193.2MB in the beginning and 243.4MB in the end (delta: -50.2MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 337.6MB. Free memory is still 243.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of shiftRight at line 56, overapproximation of bitwiseOr at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] unsigned short int var_1_8 = 4; [L27] signed long int var_1_11 = 100; [L28] signed long int var_1_12 = 8; [L29] unsigned short int var_1_13 = 128; [L30] double var_1_14 = 64.5; [L31] signed short int var_1_15 = 4; [L32] signed long int var_1_16 = -8; [L33] double var_1_17 = 255.5; [L34] double var_1_18 = 0.6; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 999999.25; [L37] signed short int var_1_21 = -64; [L38] signed char var_1_25 = -128; [L39] signed char var_1_26 = -8; [L40] unsigned char var_1_27 = 32; [L41] unsigned char var_1_31 = 32; [L42] unsigned char var_1_32 = 25; [L43] unsigned char var_1_33 = 128; [L44] double var_1_34 = 499.6; [L45] unsigned char var_1_36 = 200; [L46] unsigned short int var_1_37 = 2; [L47] unsigned short int var_1_41 = 36532; [L48] unsigned short int var_1_42 = 32367; [L49] signed char var_1_43 = -2; [L50] unsigned short int last_1_var_1_8 = 4; [L51] signed short int last_1_var_1_21 = -64; [L52] signed char last_1_var_1_25 = -128; [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L182] last_1_var_1_8 = var_1_8 [L183] last_1_var_1_21 = var_1_21 [L184] last_1_var_1_25 = var_1_25 [L194] RET updateLastVariables() [L195] CALL updateVariables() [L134] var_1_4 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L135] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L136] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L136] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L137] var_1_6 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_7=0, var_1_8=4] [L138] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_7=0, var_1_8=4] [L139] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L139] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L140] var_1_11 = __VERIFIER_nondet_long() [L141] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L141] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L142] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L142] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L143] var_1_12 = __VERIFIER_nondet_long() [L144] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L144] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L145] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L145] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L146] var_1_13 = __VERIFIER_nondet_ushort() [L147] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L147] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L148] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L148] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L149] var_1_15 = __VERIFIER_nondet_short() [L150] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L150] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L151] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L151] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L152] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L152] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L153] var_1_16 = __VERIFIER_nondet_long() [L154] CALL assume_abort_if_not(var_1_16 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L154] RET assume_abort_if_not(var_1_16 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L155] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L155] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L156] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L156] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L157] var_1_17 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L158] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L159] var_1_18 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L160] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L161] var_1_19 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L162] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L163] var_1_20 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L164] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L165] var_1_26 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L166] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L167] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L167] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L168] var_1_31 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L169] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L170] CALL assume_abort_if_not(var_1_31 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L170] RET assume_abort_if_not(var_1_31 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L171] var_1_32 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L172] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L173] CALL assume_abort_if_not(var_1_32 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L173] RET assume_abort_if_not(var_1_32 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L174] var_1_41 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_41 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L175] RET assume_abort_if_not(var_1_41 >= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L176] CALL assume_abort_if_not(var_1_41 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L176] RET assume_abort_if_not(var_1_41 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L177] var_1_42 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_42 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L178] RET assume_abort_if_not(var_1_42 >= 16383) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L179] CALL assume_abort_if_not(var_1_42 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L179] RET assume_abort_if_not(var_1_42 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L195] RET updateVariables() [L196] CALL step() [L56] EXPR last_1_var_1_8 >> var_1_15 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L56] COND TRUE (last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15) [L57] var_1_21 = (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L61] signed long int stepLocal_1 = ((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12; [L62] signed long int stepLocal_0 = last_1_var_1_21 + last_1_var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, stepLocal_1=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L63] COND FALSE !((last_1_var_1_21 * last_1_var_1_21) < stepLocal_1) [L68] var_1_8 = var_1_13 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L70] COND TRUE ! (var_1_21 > var_1_8) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L71] COND TRUE \read(var_1_4) [L72] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L75] COND FALSE !((8 / var_1_15) < (64 / var_1_16)) [L82] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L84] COND TRUE (- var_1_14) <= var_1_14 [L85] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L93] COND FALSE !(var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L96] COND FALSE !(var_1_18 >= (((((((var_1_18) > (var_1_14)) ? (var_1_18) : (var_1_14))) < 0 ) ? -((((var_1_18) > (var_1_14)) ? (var_1_18) : (var_1_14))) : ((((var_1_18) > (var_1_14)) ? (var_1_18) : (var_1_14)))))) [L103] var_1_27 = var_1_32 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=257, var_1_31=256, var_1_32=257, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L105] COND TRUE var_1_18 >= ((((var_1_17) < (var_1_14)) ? (var_1_17) : (var_1_14))) [L106] var_1_33 = ((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=257, var_1_31=256, var_1_32=257, var_1_33=0, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L108] var_1_34 = var_1_17 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_17=3, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=257, var_1_31=256, var_1_32=257, var_1_33=0, var_1_34=3, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L109] COND FALSE !(var_1_19 >= var_1_14) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_17=3, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=257, var_1_31=256, var_1_32=257, var_1_33=0, var_1_34=3, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L114] EXPR ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) | (-10 * var_1_15) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_17=3, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=257, var_1_31=256, var_1_32=257, var_1_33=0, var_1_34=3, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L114] COND TRUE -2 > (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) | (-10 * var_1_15)) [L115] var_1_37 = ((((((((25) < (var_1_15)) ? (25) : (var_1_15)))) > (((((var_1_32 + var_1_21) < 0 ) ? -(var_1_32 + var_1_21) : (var_1_32 + var_1_21))))) ? (((((25) < (var_1_15)) ? (25) : (var_1_15)))) : (((((var_1_32 + var_1_21) < 0 ) ? -(var_1_32 + var_1_21) : (var_1_32 + var_1_21)))))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_17=3, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=257, var_1_31=256, var_1_32=257, var_1_33=0, var_1_34=3, var_1_36=200, var_1_37=255, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L125] COND FALSE !(var_1_42 > var_1_41) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_17=3, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=257, var_1_31=256, var_1_32=257, var_1_33=0, var_1_34=3, var_1_36=200, var_1_37=255, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR ((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_17=3, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=257, var_1_31=256, var_1_32=257, var_1_33=0, var_1_34=3, var_1_36=200, var_1_37=255, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L187-L188] return (((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25)))) && ((! (var_1_21 > var_1_8)) ? (var_1_4 ? (var_1_25 == ((signed char) var_1_26)) : 1) : 1) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_17=3, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=257, var_1_31=256, var_1_32=257, var_1_33=0, var_1_34=3, var_1_36=200, var_1_37=255, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_17=3, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=257, var_1_31=256, var_1_32=257, var_1_33=0, var_1_34=3, var_1_36=200, var_1_37=255, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 7, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 901 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 900 mSDsluCounter, 2414 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1523 mSDsCounter, 393 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 619 IncrementalHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 393 mSolverCounterUnsat, 891 mSDtfsCounter, 619 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 813 GetRequests, 779 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=353occurred in iteration=4, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 182 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1710 NumberOfCodeBlocks, 1710 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1508 ConstructedInterpolants, 0 QuantifiedInterpolants, 3438 SizeOfPredicates, 0 NumberOfNonLiveVariables, 431 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 13731/13920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 09:03:59,501 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-pe-ci_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a67eb2296c14f3c2c0352d32dbf94d4653f0c910afa8f9438196c7a49cf42079 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:04:01,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:04:01,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 09:04:01,792 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:04:01,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:04:01,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:04:01,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:04:01,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:04:01,824 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:04:01,826 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:04:01,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:04:01,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:04:01,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:04:01,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:04:01,828 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:04:01,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:04:01,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:04:01,831 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:04:01,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:04:01,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:04:01,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:04:01,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:04:01,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:04:01,833 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 09:04:01,833 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 09:04:01,834 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:04:01,834 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 09:04:01,834 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:04:01,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:04:01,834 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:04:01,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:04:01,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:04:01,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:04:01,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:04:01,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:04:01,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:04:01,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:04:01,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:04:01,837 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 09:04:01,838 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 09:04:01,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:04:01,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:04:01,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:04:01,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:04:01,840 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 09:04:01,840 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 -> a67eb2296c14f3c2c0352d32dbf94d4653f0c910afa8f9438196c7a49cf42079 [2024-10-14 09:04:02,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:04:02,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:04:02,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:04:02,153 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:04:02,154 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:04:02,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-38.i [2024-10-14 09:04:03,590 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:04:03,829 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:04:03,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-38.i [2024-10-14 09:04:03,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/032020c81/93a8c904001e4231afb46c429657088c/FLAG93db5ddbc [2024-10-14 09:04:03,866 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/032020c81/93a8c904001e4231afb46c429657088c [2024-10-14 09:04:03,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:04:03,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:04:03,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:04:03,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:04:03,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:04:03,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:04:03" (1/1) ... [2024-10-14 09:04:03,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c01984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:04:03, skipping insertion in model container [2024-10-14 09:04:03,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:04:03" (1/1) ... [2024-10-14 09:04:03,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:04:04,045 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-38.i[919,932] [2024-10-14 09:04:04,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:04:04,139 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:04:04,152 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-38.i[919,932] [2024-10-14 09:04:04,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:04:04,225 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:04:04,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:04:04 WrapperNode [2024-10-14 09:04:04,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:04:04,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:04:04,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:04:04,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:04:04,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:04:04" (1/1) ... [2024-10-14 09:04:04,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:04:04" (1/1) ... [2024-10-14 09:04:04,278 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-10-14 09:04:04,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:04:04,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:04:04,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:04:04,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:04:04,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:04:04" (1/1) ... [2024-10-14 09:04:04,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:04:04" (1/1) ... [2024-10-14 09:04:04,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:04:04" (1/1) ... [2024-10-14 09:04:04,330 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 09:04:04,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:04:04" (1/1) ... [2024-10-14 09:04:04,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:04:04" (1/1) ... [2024-10-14 09:04:04,341 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:04:04" (1/1) ... [2024-10-14 09:04:04,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:04:04" (1/1) ... [2024-10-14 09:04:04,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:04:04" (1/1) ... [2024-10-14 09:04:04,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:04:04" (1/1) ... [2024-10-14 09:04:04,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:04:04,350 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:04:04,350 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:04:04,350 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:04:04,351 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:04:04" (1/1) ... [2024-10-14 09:04:04,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:04:04,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:04:04,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 09:04:04,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 09:04:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:04:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 09:04:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:04:04,452 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:04:04,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:04:04,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:04:04,532 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:04:04,534 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:04:11,451 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 09:04:11,455 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:04:11,572 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:04:11,572 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:04:11,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:04:11 BoogieIcfgContainer [2024-10-14 09:04:11,573 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:04:11,579 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:04:11,579 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:04:11,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:04:11,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:04:03" (1/3) ... [2024-10-14 09:04:11,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7d8192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:04:11, skipping insertion in model container [2024-10-14 09:04:11,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:04:04" (2/3) ... [2024-10-14 09:04:11,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7d8192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:04:11, skipping insertion in model container [2024-10-14 09:04:11,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:04:11" (3/3) ... [2024-10-14 09:04:11,593 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-38.i [2024-10-14 09:04:11,623 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:04:11,624 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:04:11,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:04:11,745 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;@2410f2fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:04:11,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:04:11,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 09:04:11,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-14 09:04:11,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:04:11,780 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:04:11,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:04:11,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:04:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1421136632, now seen corresponding path program 1 times [2024-10-14 09:04:11,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:04:11,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957092952] [2024-10-14 09:04:11,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:04:11,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:04:11,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:04:11,820 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:04:11,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 09:04:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:04:12,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 09:04:12,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:04:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:04:12,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:04:12,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:04:12,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957092952] [2024-10-14 09:04:12,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957092952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:04:12,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:04:12,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:04:12,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707512603] [2024-10-14 09:04:12,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:04:12,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:04:12,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:04:12,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:04:12,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:04:12,355 INFO L87 Difference]: Start difference. First operand has 81 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:04:15,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:04:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:04:15,111 INFO L93 Difference]: Finished difference Result 159 states and 294 transitions. [2024-10-14 09:04:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:04:15,147 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 184 [2024-10-14 09:04:15,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:04:15,154 INFO L225 Difference]: With dead ends: 159 [2024-10-14 09:04:15,154 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 09:04:15,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:04:15,176 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 09:04:15,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 09:04:15,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 09:04:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-14 09:04:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 09:04:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 126 transitions. [2024-10-14 09:04:15,209 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 126 transitions. Word has length 184 [2024-10-14 09:04:15,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:04:15,211 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 126 transitions. [2024-10-14 09:04:15,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:04:15,211 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 126 transitions. [2024-10-14 09:04:15,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-14 09:04:15,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:04:15,214 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:04:15,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 09:04:15,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:04:15,415 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:04:15,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:04:15,416 INFO L85 PathProgramCache]: Analyzing trace with hash 400068278, now seen corresponding path program 1 times [2024-10-14 09:04:15,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:04:15,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330437944] [2024-10-14 09:04:15,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:04:15,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:04:15,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:04:15,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:04:15,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 09:04:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:04:15,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 09:04:15,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:04:17,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:04:17,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:04:17,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:04:17,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330437944] [2024-10-14 09:04:17,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330437944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:04:17,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:04:17,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:04:17,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653183458] [2024-10-14 09:04:17,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:04:17,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:04:17,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:04:17,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:04:17,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:04:17,603 INFO L87 Difference]: Start difference. First operand 79 states and 126 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:04:21,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:04:25,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:04:29,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:04:29,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:04:29,424 INFO L93 Difference]: Finished difference Result 360 states and 573 transitions. [2024-10-14 09:04:29,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 09:04:29,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 184 [2024-10-14 09:04:29,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:04:29,429 INFO L225 Difference]: With dead ends: 360 [2024-10-14 09:04:29,429 INFO L226 Difference]: Without dead ends: 282 [2024-10-14 09:04:29,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 09:04:29,431 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 228 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2024-10-14 09:04:29,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 658 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 40 Invalid, 1 Unknown, 0 Unchecked, 11.6s Time] [2024-10-14 09:04:29,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-14 09:04:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 155. [2024-10-14 09:04:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 92 states have internal predecessors, (129), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 09:04:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 249 transitions. [2024-10-14 09:04:29,459 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 249 transitions. Word has length 184 [2024-10-14 09:04:29,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:04:29,462 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 249 transitions. [2024-10-14 09:04:29,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:04:29,463 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 249 transitions. [2024-10-14 09:04:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-14 09:04:29,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:04:29,467 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:04:29,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 09:04:29,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:04:29,672 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:04:29,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:04:29,674 INFO L85 PathProgramCache]: Analyzing trace with hash -568321375, now seen corresponding path program 1 times [2024-10-14 09:04:29,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:04:29,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913589451] [2024-10-14 09:04:29,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:04:29,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:04:29,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:04:29,679 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:04:29,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 09:04:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:04:30,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 09:04:30,079 INFO L278 TraceCheckSpWp]: Computing forward predicates...