./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.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 734c3c8d8fcb1b5f511dd20f78d90b7e50c76be5359a62f6160d8ac75ffd147b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:50:36,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:50:36,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 13:50:36,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:50:36,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:50:36,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:50:36,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:50:36,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:50:36,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:50:36,888 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:50:36,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:50:36,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:50:36,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:50:36,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:50:36,890 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:50:36,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:50:36,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:50:36,891 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:50:36,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 13:50:36,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:50:36,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:50:36,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:50:36,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:50:36,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:50:36,894 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:50:36,894 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:50:36,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:50:36,895 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:50:36,895 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:50:36,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:50:36,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:50:36,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:50:36,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:50:36,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:50:36,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:50:36,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:50:36,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 13:50:36,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 13:50:36,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:50:36,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:50:36,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:50:36,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:50:36,900 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 -> 734c3c8d8fcb1b5f511dd20f78d90b7e50c76be5359a62f6160d8ac75ffd147b [2024-11-16 13:50:37,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:50:37,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:50:37,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:50:37,219 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:50:37,219 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:50:37,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i [2024-11-16 13:50:38,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:50:38,874 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:50:38,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i [2024-11-16 13:50:38,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86008902e/7ed4dfaa6d0a4e15b9c5c2238cb032c6/FLAG18aa9e916 [2024-11-16 13:50:39,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86008902e/7ed4dfaa6d0a4e15b9c5c2238cb032c6 [2024-11-16 13:50:39,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:50:39,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:50:39,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:50:39,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:50:39,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:50:39,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:50:39" (1/1) ... [2024-11-16 13:50:39,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d78b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:39, skipping insertion in model container [2024-11-16 13:50:39,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:50:39" (1/1) ... [2024-11-16 13:50:39,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:50:39,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i[919,932] [2024-11-16 13:50:39,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:50:39,561 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:50:39,574 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i[919,932] [2024-11-16 13:50:39,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:50:39,636 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:50:39,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:39 WrapperNode [2024-11-16 13:50:39,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:50:39,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:50:39,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:50:39,638 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:50:39,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:39" (1/1) ... [2024-11-16 13:50:39,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:39" (1/1) ... [2024-11-16 13:50:39,708 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 222 [2024-11-16 13:50:39,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:50:39,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:50:39,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:50:39,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:50:39,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:39" (1/1) ... [2024-11-16 13:50:39,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:39" (1/1) ... [2024-11-16 13:50:39,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:39" (1/1) ... [2024-11-16 13:50:39,767 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 13:50:39,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:39" (1/1) ... [2024-11-16 13:50:39,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:39" (1/1) ... [2024-11-16 13:50:39,784 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:39" (1/1) ... [2024-11-16 13:50:39,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:39" (1/1) ... [2024-11-16 13:50:39,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:39" (1/1) ... [2024-11-16 13:50:39,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:39" (1/1) ... [2024-11-16 13:50:39,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:50:39,800 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:50:39,800 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:50:39,800 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:50:39,801 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:39" (1/1) ... [2024-11-16 13:50:39,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:50:39,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:50:39,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 13:50:39,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 13:50:39,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:50:39,892 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:50:39,892 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:50:39,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 13:50:39,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:50:39,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:50:40,004 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:50:40,008 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:50:40,542 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 13:50:40,543 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:50:40,565 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:50:40,565 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:50:40,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:50:40 BoogieIcfgContainer [2024-11-16 13:50:40,567 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:50:40,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:50:40,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:50:40,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:50:40,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:50:39" (1/3) ... [2024-11-16 13:50:40,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4506839a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:50:40, skipping insertion in model container [2024-11-16 13:50:40,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:39" (2/3) ... [2024-11-16 13:50:40,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4506839a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:50:40, skipping insertion in model container [2024-11-16 13:50:40,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:50:40" (3/3) ... [2024-11-16 13:50:40,577 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i [2024-11-16 13:50:40,596 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:50:40,597 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:50:40,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:50:40,674 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;@46459824, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:50:40,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:50:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 13:50:40,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-16 13:50:40,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:50:40,698 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:50:40,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:50:40,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:50:40,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1740873760, now seen corresponding path program 1 times [2024-11-16 13:50:40,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:50:40,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43392770] [2024-11-16 13:50:40,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:50:40,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:50:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:50:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:50:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:50:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 13:50:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 13:50:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 13:50:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 13:50:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:50:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:50:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:50:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:50:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:50:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:50:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:50:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:50:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:50:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:50:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:50:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:50:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:50:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 13:50:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:50:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 13:50:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:50:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:50:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:50:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:50:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 13:50:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-16 13:50:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 13:50:41,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:50:41,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43392770] [2024-11-16 13:50:41,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43392770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:50:41,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:50:41,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:50:41,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576787613] [2024-11-16 13:50:41,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:50:41,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:50:41,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:50:41,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:50:41,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:50:41,304 INFO L87 Difference]: Start difference. First operand has 99 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-16 13:50:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:50:41,353 INFO L93 Difference]: Finished difference Result 189 states and 328 transitions. [2024-11-16 13:50:41,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:50:41,356 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 194 [2024-11-16 13:50:41,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:50:41,366 INFO L225 Difference]: With dead ends: 189 [2024-11-16 13:50:41,367 INFO L226 Difference]: Without dead ends: 93 [2024-11-16 13:50:41,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:50:41,377 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:50:41,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:50:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-16 13:50:41,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-16 13:50:41,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 13:50:41,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2024-11-16 13:50:41,451 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 194 [2024-11-16 13:50:41,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:50:41,453 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2024-11-16 13:50:41,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-16 13:50:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2024-11-16 13:50:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-16 13:50:41,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:50:41,464 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:50:41,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 13:50:41,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:50:41,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:50:41,466 INFO L85 PathProgramCache]: Analyzing trace with hash 691304775, now seen corresponding path program 1 times [2024-11-16 13:50:41,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:50:41,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375033174] [2024-11-16 13:50:41,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:50:41,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:50:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:50:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:50:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:50:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 13:50:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 13:50:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 13:50:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 13:50:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:50:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:50:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:50:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:50:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:50:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:50:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:50:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:50:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:50:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:50:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:50:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:50:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:50:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 13:50:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:50:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 13:50:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:50:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:50:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:50:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:50:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 13:50:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-16 13:50:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 13:50:41,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:50:41,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375033174] [2024-11-16 13:50:41,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375033174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:50:41,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:50:41,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:50:41,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532961726] [2024-11-16 13:50:41,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:50:41,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:50:41,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:50:41,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:50:41,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:50:41,977 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 13:50:42,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:50:42,081 INFO L93 Difference]: Finished difference Result 219 states and 339 transitions. [2024-11-16 13:50:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:50:42,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2024-11-16 13:50:42,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:50:42,089 INFO L225 Difference]: With dead ends: 219 [2024-11-16 13:50:42,089 INFO L226 Difference]: Without dead ends: 129 [2024-11-16 13:50:42,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:50:42,092 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 45 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:50:42,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 259 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:50:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-16 13:50:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2024-11-16 13:50:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 13:50:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 183 transitions. [2024-11-16 13:50:42,113 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 183 transitions. Word has length 194 [2024-11-16 13:50:42,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:50:42,116 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 183 transitions. [2024-11-16 13:50:42,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 13:50:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 183 transitions. [2024-11-16 13:50:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-16 13:50:42,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:50:42,126 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:50:42,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 13:50:42,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:50:42,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:50:42,130 INFO L85 PathProgramCache]: Analyzing trace with hash 848826088, now seen corresponding path program 1 times [2024-11-16 13:50:42,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:50:42,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133755084] [2024-11-16 13:50:42,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:50:42,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:50:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:50:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:50:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:50:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 13:50:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 13:50:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 13:50:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 13:50:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:50:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:50:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:50:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:50:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:50:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:50:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:50:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:50:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:50:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:50:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:50:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:50:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:50:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 13:50:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:50:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 13:50:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:50:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:50:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:50:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:50:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 13:50:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-16 13:50:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 13:50:42,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:50:42,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133755084] [2024-11-16 13:50:42,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133755084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:50:42,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:50:42,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:50:42,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277939539] [2024-11-16 13:50:42,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:50:42,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:50:42,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:50:42,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:50:42,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:50:42,594 INFO L87 Difference]: Start difference. First operand 118 states and 183 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 13:50:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:50:42,706 INFO L93 Difference]: Finished difference Result 330 states and 510 transitions. [2024-11-16 13:50:42,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:50:42,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2024-11-16 13:50:42,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:50:42,715 INFO L225 Difference]: With dead ends: 330 [2024-11-16 13:50:42,715 INFO L226 Difference]: Without dead ends: 215 [2024-11-16 13:50:42,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:50:42,720 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 77 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:50:42,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 270 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:50:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-16 13:50:42,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2024-11-16 13:50:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 151 states have (on average 1.390728476821192) internal successors, (210), 151 states have internal predecessors, (210), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-16 13:50:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 326 transitions. [2024-11-16 13:50:42,757 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 326 transitions. Word has length 194 [2024-11-16 13:50:42,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:50:42,758 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 326 transitions. [2024-11-16 13:50:42,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 13:50:42,759 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 326 transitions. [2024-11-16 13:50:42,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-16 13:50:42,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:50:42,762 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:50:42,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 13:50:42,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:50:42,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:50:42,763 INFO L85 PathProgramCache]: Analyzing trace with hash 21096966, now seen corresponding path program 1 times [2024-11-16 13:50:42,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:50:42,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464068415] [2024-11-16 13:50:42,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:50:42,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:50:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:50:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:50:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:50:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 13:50:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 13:50:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 13:50:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 13:50:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:50:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:50:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:50:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:50:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:50:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:50:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:50:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:50:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:50:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:50:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:50:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:50:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:50:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 13:50:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:50:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 13:50:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:50:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:50:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:50:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:50:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 13:50:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-16 13:50:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 13:50:43,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:50:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464068415] [2024-11-16 13:50:43,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464068415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:50:43,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:50:43,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 13:50:43,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470210300] [2024-11-16 13:50:43,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:50:43,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 13:50:43,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:50:43,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 13:50:43,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 13:50:43,355 INFO L87 Difference]: Start difference. First operand 212 states and 326 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 13:50:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:50:43,727 INFO L93 Difference]: Finished difference Result 606 states and 918 transitions. [2024-11-16 13:50:43,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 13:50:43,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 195 [2024-11-16 13:50:43,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:50:43,737 INFO L225 Difference]: With dead ends: 606 [2024-11-16 13:50:43,737 INFO L226 Difference]: Without dead ends: 397 [2024-11-16 13:50:43,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:50:43,741 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 147 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 13:50:43,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 562 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 13:50:43,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-16 13:50:43,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 313. [2024-11-16 13:50:43,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 226 states have (on average 1.3938053097345133) internal successors, (315), 228 states have internal predecessors, (315), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-16 13:50:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 479 transitions. [2024-11-16 13:50:43,797 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 479 transitions. Word has length 195 [2024-11-16 13:50:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:50:43,798 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 479 transitions. [2024-11-16 13:50:43,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 13:50:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 479 transitions. [2024-11-16 13:50:43,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-16 13:50:43,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:50:43,800 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:50:43,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 13:50:43,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:50:43,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:50:43,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1786357497, now seen corresponding path program 1 times [2024-11-16 13:50:43,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:50:43,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747079788] [2024-11-16 13:50:43,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:50:43,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:50:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:50:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:50:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:50:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 13:50:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 13:50:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 13:50:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 13:50:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:50:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:50:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:50:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:50:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:50:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:50:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:50:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:50:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:50:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:50:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:50:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:50:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:50:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 13:50:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:50:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 13:50:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:50:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:50:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:50:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:50:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 13:50:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-16 13:50:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 13:50:44,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:50:44,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747079788] [2024-11-16 13:50:44,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747079788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:50:44,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:50:44,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 13:50:44,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701318515] [2024-11-16 13:50:44,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:50:44,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 13:50:44,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:50:44,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 13:50:44,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 13:50:44,410 INFO L87 Difference]: Start difference. First operand 313 states and 479 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 13:50:45,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:50:45,109 INFO L93 Difference]: Finished difference Result 1019 states and 1550 transitions. [2024-11-16 13:50:45,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 13:50:45,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 195 [2024-11-16 13:50:45,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:50:45,116 INFO L225 Difference]: With dead ends: 1019 [2024-11-16 13:50:45,117 INFO L226 Difference]: Without dead ends: 709 [2024-11-16 13:50:45,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-16 13:50:45,119 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 198 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 13:50:45,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 707 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 13:50:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-11-16 13:50:45,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 419. [2024-11-16 13:50:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 302 states have (on average 1.400662251655629) internal successors, (423), 304 states have internal predecessors, (423), 111 states have call successors, (111), 5 states have call predecessors, (111), 5 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-16 13:50:45,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 645 transitions. [2024-11-16 13:50:45,185 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 645 transitions. Word has length 195 [2024-11-16 13:50:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:50:45,186 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 645 transitions. [2024-11-16 13:50:45,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 13:50:45,186 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 645 transitions. [2024-11-16 13:50:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-16 13:50:45,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:50:45,189 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:50:45,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 13:50:45,190 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:50:45,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:50:45,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1596163962, now seen corresponding path program 1 times [2024-11-16 13:50:45,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:50:45,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691247337] [2024-11-16 13:50:45,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:50:45,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:50:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:50:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:50:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:50:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 13:50:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 13:50:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 13:50:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 13:50:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:50:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:50:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:50:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:50:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:50:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:50:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:50:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:50:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:50:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:50:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:50:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:50:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:50:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 13:50:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:50:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 13:50:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:50:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:50:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:50:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:50:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 13:50:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-16 13:50:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-16 13:50:45,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:50:45,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691247337] [2024-11-16 13:50:45,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691247337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:50:45,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454831298] [2024-11-16 13:50:45,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:50:45,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:50:45,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:50:45,635 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 13:50:45,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 13:50:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:50:45,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 13:50:45,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:50:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 378 proven. 9 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2024-11-16 13:50:45,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:50:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-16 13:50:46,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454831298] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:50:46,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 13:50:46,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-16 13:50:46,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066393497] [2024-11-16 13:50:46,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 13:50:46,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 13:50:46,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:50:46,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 13:50:46,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:50:46,303 INFO L87 Difference]: Start difference. First operand 419 states and 645 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-16 13:50:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:50:46,552 INFO L93 Difference]: Finished difference Result 757 states and 1146 transitions. [2024-11-16 13:50:46,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 13:50:46,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 196 [2024-11-16 13:50:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:50:46,556 INFO L225 Difference]: With dead ends: 757 [2024-11-16 13:50:46,557 INFO L226 Difference]: Without dead ends: 447 [2024-11-16 13:50:46,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 446 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-16 13:50:46,559 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 83 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:50:46,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 259 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:50:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-16 13:50:46,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 431. [2024-11-16 13:50:46,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 311 states have (on average 1.369774919614148) internal successors, (426), 313 states have internal predecessors, (426), 111 states have call successors, (111), 8 states have call predecessors, (111), 8 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-16 13:50:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 648 transitions. [2024-11-16 13:50:46,614 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 648 transitions. Word has length 196 [2024-11-16 13:50:46,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:50:46,615 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 648 transitions. [2024-11-16 13:50:46,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-16 13:50:46,616 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 648 transitions. [2024-11-16 13:50:46,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-16 13:50:46,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:50:46,618 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:50:46,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 13:50:46,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 13:50:46,823 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:50:46,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:50:46,824 INFO L85 PathProgramCache]: Analyzing trace with hash 146646373, now seen corresponding path program 1 times [2024-11-16 13:50:46,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:50:46,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212995152] [2024-11-16 13:50:46,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:50:46,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:50:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:50:46,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112562412] [2024-11-16 13:50:46,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:50:46,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:50:46,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:50:46,957 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 13:50:46,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 13:50:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:50:47,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 13:50:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:50:47,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 13:50:47,351 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 13:50:47,353 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 13:50:47,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 13:50:47,555 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-11-16 13:50:47,558 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:50:47,694 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 13:50:47,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 01:50:47 BoogieIcfgContainer [2024-11-16 13:50:47,698 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 13:50:47,698 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 13:50:47,699 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 13:50:47,699 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 13:50:47,699 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:50:40" (3/4) ... [2024-11-16 13:50:47,702 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 13:50:47,703 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 13:50:47,703 INFO L158 Benchmark]: Toolchain (without parser) took 8476.90ms. Allocated memory was 172.0MB in the beginning and 268.4MB in the end (delta: 96.5MB). Free memory was 136.9MB in the beginning and 83.7MB in the end (delta: 53.1MB). Peak memory consumption was 149.9MB. Max. memory is 16.1GB. [2024-11-16 13:50:47,704 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:50:47,704 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.25ms. Allocated memory is still 172.0MB. Free memory was 136.9MB in the beginning and 119.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 13:50:47,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.16ms. Allocated memory is still 172.0MB. Free memory was 119.4MB in the beginning and 114.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 13:50:47,705 INFO L158 Benchmark]: Boogie Preprocessor took 89.93ms. Allocated memory is still 172.0MB. Free memory was 114.2MB in the beginning and 107.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 13:50:47,706 INFO L158 Benchmark]: IcfgBuilder took 767.46ms. Allocated memory is still 172.0MB. Free memory was 107.9MB in the beginning and 117.4MB in the end (delta: -9.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 13:50:47,706 INFO L158 Benchmark]: TraceAbstraction took 7128.10ms. Allocated memory was 172.0MB in the beginning and 268.4MB in the end (delta: 96.5MB). Free memory was 116.3MB in the beginning and 83.7MB in the end (delta: 32.6MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. [2024-11-16 13:50:47,707 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 268.4MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:50:47,708 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.17ms. Allocated memory is still 109.1MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.25ms. Allocated memory is still 172.0MB. Free memory was 136.9MB in the beginning and 119.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.16ms. Allocated memory is still 172.0MB. Free memory was 119.4MB in the beginning and 114.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.93ms. Allocated memory is still 172.0MB. Free memory was 114.2MB in the beginning and 107.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 767.46ms. Allocated memory is still 172.0MB. Free memory was 107.9MB in the beginning and 117.4MB in the end (delta: -9.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7128.10ms. Allocated memory was 172.0MB in the beginning and 268.4MB in the end (delta: 96.5MB). Free memory was 116.3MB in the beginning and 83.7MB in the end (delta: 32.6MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 268.4MB. Free memory is still 83.7MB. 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 200, overapproximation of someBinaryFLOATComparisonOperation at line 193. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] unsigned short int var_1_20 = 8; [L41] unsigned char var_1_22 = 0; [L42] unsigned char var_1_25 = 1; [L43] unsigned char var_1_26 = 1; [L44] unsigned char var_1_28 = 0; [L45] double var_1_29 = 50.2; [L46] signed char var_1_32 = -25; [L47] unsigned char var_1_36 = 0; [L48] unsigned char var_1_37 = 0; [L49] signed short int var_1_38 = -4; [L50] float var_1_40 = 16.2; [L51] float var_1_41 = 10.75; [L52] float var_1_42 = 999.6; [L53] float var_1_43 = 64.5; [L54] signed long int var_1_44 = -2; [L55] signed short int var_1_45 = 2; [L56] unsigned char last_1_var_1_8 = 5; [L57] unsigned short int last_1_var_1_18 = 64; VAL [isInitial=0, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L196] last_1_var_1_8 = var_1_8 [L197] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L147] var_1_2 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L148] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L149] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L149] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L150] var_1_3 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L151] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L152] var_1_4 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L153] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L154] var_1_5 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L155] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L156] var_1_6 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L157] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L158] var_1_7 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_8=5, var_1_9=307/20] [L159] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_8=5, var_1_9=307/20] [L160] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5, var_1_9=307/20] [L160] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5, var_1_9=307/20] [L161] var_1_9 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L162] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L163] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L163] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L164] var_1_10 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L165] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L166] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L166] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L167] var_1_11 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L168] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L169] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L169] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L170] var_1_15 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L171] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L172] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L172] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L173] var_1_16 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L174] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L175] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L175] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L176] var_1_17 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L177] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L178] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L178] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L180] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L181] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L181] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L182] var_1_28 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L183] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L184] CALL assume_abort_if_not(var_1_28 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L184] RET assume_abort_if_not(var_1_28 <= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L185] var_1_37 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L186] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L187] CALL assume_abort_if_not(var_1_37 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L187] RET assume_abort_if_not(var_1_37 <= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L188] var_1_41 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_41 >= -461168.6018427382800e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L189] RET assume_abort_if_not((var_1_41 >= -461168.6018427382800e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L190] var_1_42 = __VERIFIER_nondet_float() [L191] CALL assume_abort_if_not((var_1_42 >= -461168.6018427382800e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L191] RET assume_abort_if_not((var_1_42 >= -461168.6018427382800e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L192] var_1_43 = __VERIFIER_nondet_float() [L193] CALL assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L193] RET assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L208] RET updateVariables() [L209] CALL step() [L61] COND FALSE !(\read(var_1_2)) [L68] var_1_1 = 1 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L70] unsigned short int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L71] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L72] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L80] COND FALSE !(\read(var_1_2)) [L89] var_1_12 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L91] signed long int stepLocal_1 = ((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)); VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, stepLocal_1=127, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L92] COND TRUE var_1_10 == stepLocal_1 [L93] var_1_14 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L97] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L100] COND FALSE !(var_1_8 == var_1_13) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L103] COND TRUE last_1_var_1_18 != var_1_16 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L104] COND FALSE !(-256 >= var_1_13) [L107] var_1_18 = var_1_15 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=127, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L113] var_1_20 = var_1_11 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=127, var_1_1=1, var_1_20=128, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L114] COND TRUE var_1_2 || (2.65f > var_1_3) [L115] var_1_22 = (! (! var_1_25)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=127, var_1_1=1, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L117] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=127, var_1_1=1, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L120] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=127, var_1_1=1, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=-25, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L123] COND TRUE (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) - ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) <= var_1_11 [L124] var_1_32 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=127, var_1_1=1, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=0, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L126] EXPR var_1_16 & var_1_15 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=127, var_1_1=1, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=0, var_1_36=0, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L126] COND TRUE (var_1_16 & var_1_15) <= ((var_1_15 - var_1_16) + -16) [L127] var_1_36 = var_1_25 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=127, var_1_1=1, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=0, var_1_36=1, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L135] EXPR var_1_11 >> var_1_16 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=127, var_1_1=1, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=0, var_1_36=1, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L135] COND FALSE !(((var_1_11 | 1) % var_1_15) >= (var_1_11 >> var_1_16)) [L138] COND FALSE !(\read(var_1_37)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=127, var_1_1=1, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=0, var_1_36=1, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L141] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=127, var_1_1=1, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=0, var_1_36=1, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=127] [L144] var_1_45 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=127, var_1_1=1, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=0, var_1_36=1, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=127, var_1_7=0, var_1_8=127] [L209] RET step() [L210] CALL, EXPR property() [L200-L201] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + last_1_var_1_8))) : (var_1_1 == ((unsigned short int) last_1_var_1_8))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (last_1_var_1_18 + var_1_10)))) : (var_1_12 == ((signed long int) last_1_var_1_18))) : 1) : (var_1_12 == ((signed long int) last_1_var_1_18)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_8 == var_1_13) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) : ((last_1_var_1_18 != var_1_16) ? ((-256 >= var_1_13) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=127, var_1_1=1, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=0, var_1_36=1, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=127, var_1_7=0, var_1_8=127] [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=127, var_1_1=1, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=0, var_1_36=1, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=127, var_1_7=0, var_1_8=127] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=-128, var_1_12=64, var_1_13=256, var_1_14=0, var_1_15=127, var_1_16=-256, var_1_17=0, var_1_18=127, var_1_1=1, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=256, var_1_29=251/5, var_1_2=-256, var_1_32=0, var_1_36=1, var_1_37=256, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=127, var_1_7=0, var_1_8=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 7, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 574 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 550 mSDsluCounter, 2198 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1356 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 840 IncrementalHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 842 mSDtfsCounter, 840 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 805 GetRequests, 777 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=431occurred in iteration=6, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 404 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1756 NumberOfCodeBlocks, 1756 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1552 ConstructedInterpolants, 0 QuantifiedInterpolants, 2791 SizeOfPredicates, 1 NumberOfNonLiveVariables, 451 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 12965/12992 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 13:50:47,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.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 734c3c8d8fcb1b5f511dd20f78d90b7e50c76be5359a62f6160d8ac75ffd147b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:50:50,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:50:50,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 13:50:50,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:50:50,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:50:50,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:50:50,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:50:50,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:50:50,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:50:50,134 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:50:50,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:50:50,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:50:50,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:50:50,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:50:50,139 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:50:50,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:50:50,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:50:50,140 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:50:50,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:50:50,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:50:50,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:50:50,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:50:50,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:50:50,143 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 13:50:50,144 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 13:50:50,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:50:50,144 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 13:50:50,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:50:50,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:50:50,145 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:50:50,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:50:50,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:50:50,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:50:50,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:50:50,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:50:50,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:50:50,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:50:50,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:50:50,148 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 13:50:50,148 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 13:50:50,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:50:50,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:50:50,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:50:50,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:50:50,149 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 -> 734c3c8d8fcb1b5f511dd20f78d90b7e50c76be5359a62f6160d8ac75ffd147b [2024-11-16 13:50:50,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:50:50,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:50:50,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:50:50,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:50:50,534 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:50:50,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i [2024-11-16 13:50:52,063 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:50:52,312 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:50:52,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i [2024-11-16 13:50:52,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9801d5beb/bb87b86e5e4849e3ba316ceedc7f52f8/FLAGa7e4c971b [2024-11-16 13:50:52,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9801d5beb/bb87b86e5e4849e3ba316ceedc7f52f8 [2024-11-16 13:50:52,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:50:52,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:50:52,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:50:52,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:50:52,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:50:52,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:50:52" (1/1) ... [2024-11-16 13:50:52,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e4f83a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:52, skipping insertion in model container [2024-11-16 13:50:52,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:50:52" (1/1) ... [2024-11-16 13:50:52,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:50:52,590 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i[919,932] [2024-11-16 13:50:52,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:50:52,704 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:50:52,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i[919,932] [2024-11-16 13:50:52,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:50:52,803 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:50:52,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:52 WrapperNode [2024-11-16 13:50:52,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:50:52,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:50:52,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:50:52,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:50:52,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:52" (1/1) ... [2024-11-16 13:50:52,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:52" (1/1) ... [2024-11-16 13:50:52,874 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-11-16 13:50:52,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:50:52,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:50:52,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:50:52,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:50:52,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:52" (1/1) ... [2024-11-16 13:50:52,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:52" (1/1) ... [2024-11-16 13:50:52,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:52" (1/1) ... [2024-11-16 13:50:52,920 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 13:50:52,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:52" (1/1) ... [2024-11-16 13:50:52,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:52" (1/1) ... [2024-11-16 13:50:52,940 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:52" (1/1) ... [2024-11-16 13:50:52,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:52" (1/1) ... [2024-11-16 13:50:52,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:52" (1/1) ... [2024-11-16 13:50:52,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:52" (1/1) ... [2024-11-16 13:50:52,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:50:52,963 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:50:52,963 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:50:52,963 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:50:52,964 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:52" (1/1) ... [2024-11-16 13:50:52,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:50:52,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:50:52,999 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 13:50:53,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 13:50:53,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:50:53,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 13:50:53,045 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:50:53,046 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:50:53,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:50:53,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:50:53,132 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:50:53,134 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:51:19,558 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 13:51:19,558 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:51:19,572 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:51:19,573 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:51:19,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:51:19 BoogieIcfgContainer [2024-11-16 13:51:19,573 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:51:19,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:51:19,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:51:19,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:51:19,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:50:52" (1/3) ... [2024-11-16 13:51:19,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6277bc72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:51:19, skipping insertion in model container [2024-11-16 13:51:19,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:50:52" (2/3) ... [2024-11-16 13:51:19,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6277bc72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:51:19, skipping insertion in model container [2024-11-16 13:51:19,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:51:19" (3/3) ... [2024-11-16 13:51:19,582 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i [2024-11-16 13:51:19,600 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:51:19,600 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:51:19,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:51:19,679 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;@63ba2921, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:51:19,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:51:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 13:51:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-16 13:51:19,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:51:19,702 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:51:19,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:51:19,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:51:19,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1622796829, now seen corresponding path program 1 times [2024-11-16 13:51:19,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:51:19,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583240577] [2024-11-16 13:51:19,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:51:19,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:51:19,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:51:19,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:51:19,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 13:51:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:51:21,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 13:51:21,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:51:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 776 proven. 0 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2024-11-16 13:51:21,464 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:51:21,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:51:21,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583240577] [2024-11-16 13:51:21,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583240577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:51:21,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:51:21,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:51:21,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168364810] [2024-11-16 13:51:21,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:51:21,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:51:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:51:21,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:51:21,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:51:21,503 INFO L87 Difference]: Start difference. First operand has 94 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-16 13:51:21,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:51:21,534 INFO L93 Difference]: Finished difference Result 179 states and 312 transitions. [2024-11-16 13:51:21,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:51:21,536 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 192 [2024-11-16 13:51:21,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:51:21,544 INFO L225 Difference]: With dead ends: 179 [2024-11-16 13:51:21,545 INFO L226 Difference]: Without dead ends: 88 [2024-11-16 13:51:21,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:51:21,555 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:51:21,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:51:21,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-16 13:51:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-16 13:51:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 13:51:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 135 transitions. [2024-11-16 13:51:21,600 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 135 transitions. Word has length 192 [2024-11-16 13:51:21,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:51:21,600 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 135 transitions. [2024-11-16 13:51:21,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-16 13:51:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 135 transitions. [2024-11-16 13:51:21,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-16 13:51:21,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:51:21,606 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:51:21,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 13:51:21,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:51:21,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:51:21,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:51:21,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1181965578, now seen corresponding path program 1 times [2024-11-16 13:51:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:51:21,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078343114] [2024-11-16 13:51:21,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:51:21,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:51:21,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:51:21,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:51:21,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 13:51:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:51:23,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 13:51:23,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:51:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 13:51:23,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:51:23,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:51:23,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078343114] [2024-11-16 13:51:23,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078343114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:51:23,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:51:23,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:51:23,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461578380] [2024-11-16 13:51:23,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:51:23,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:51:23,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:51:23,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:51:23,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:51:23,722 INFO L87 Difference]: Start difference. First operand 88 states and 135 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 13:51:28,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:51:33,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:51:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:51:33,287 INFO L93 Difference]: Finished difference Result 204 states and 315 transitions. [2024-11-16 13:51:33,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:51:33,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-11-16 13:51:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:51:33,294 INFO L225 Difference]: With dead ends: 204 [2024-11-16 13:51:33,295 INFO L226 Difference]: Without dead ends: 119 [2024-11-16 13:51:33,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:51:33,297 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 41 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-16 13:51:33,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 247 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2024-11-16 13:51:33,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-16 13:51:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2024-11-16 13:51:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 13:51:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 167 transitions. [2024-11-16 13:51:33,318 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 167 transitions. Word has length 192 [2024-11-16 13:51:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:51:33,322 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 167 transitions. [2024-11-16 13:51:33,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 13:51:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 167 transitions. [2024-11-16 13:51:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-16 13:51:33,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:51:33,325 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:51:33,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 13:51:33,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:51:33,526 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:51:33,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:51:33,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1924012309, now seen corresponding path program 1 times [2024-11-16 13:51:33,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:51:33,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313494825] [2024-11-16 13:51:33,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:51:33,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:51:33,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:51:33,531 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:51:33,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 13:51:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:51:35,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 13:51:35,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:51:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 13:51:41,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:51:41,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:51:41,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313494825] [2024-11-16 13:51:41,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313494825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:51:41,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:51:41,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:51:41,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299266576] [2024-11-16 13:51:41,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:51:41,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:51:41,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:51:41,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:51:41,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:51:41,382 INFO L87 Difference]: Start difference. First operand 108 states and 167 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 13:51:46,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:51:50,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:51:50,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:51:50,039 INFO L93 Difference]: Finished difference Result 305 states and 470 transitions. [2024-11-16 13:51:50,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:51:50,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-11-16 13:51:50,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:51:50,198 INFO L225 Difference]: With dead ends: 305 [2024-11-16 13:51:50,198 INFO L226 Difference]: Without dead ends: 200 [2024-11-16 13:51:50,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:51:50,200 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 37 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-16 13:51:50,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 259 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2024-11-16 13:51:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-16 13:51:50,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2024-11-16 13:51:50,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 136 states have (on average 1.3676470588235294) internal successors, (186), 136 states have internal predecessors, (186), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-16 13:51:50,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 302 transitions. [2024-11-16 13:51:50,245 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 302 transitions. Word has length 192 [2024-11-16 13:51:50,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:51:50,246 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 302 transitions. [2024-11-16 13:51:50,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 13:51:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 302 transitions. [2024-11-16 13:51:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-16 13:51:50,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:51:50,249 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:51:50,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 13:51:50,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:51:50,450 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:51:50,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:51:50,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2140937857, now seen corresponding path program 1 times [2024-11-16 13:51:50,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:51:50,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812151394] [2024-11-16 13:51:50,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:51:50,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:51:50,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:51:50,456 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:51:50,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 13:51:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:51:51,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 13:51:51,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:51:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 378 proven. 9 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2024-11-16 13:51:53,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:51:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-16 13:51:57,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:51:57,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812151394] [2024-11-16 13:51:57,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812151394] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:51:57,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 13:51:57,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-16 13:51:57,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230041324] [2024-11-16 13:51:57,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 13:51:57,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 13:51:57,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:51:57,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 13:51:57,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:51:57,609 INFO L87 Difference]: Start difference. First operand 197 states and 302 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-16 13:52:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:52:01,309 INFO L93 Difference]: Finished difference Result 407 states and 615 transitions. [2024-11-16 13:52:01,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 13:52:01,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 193 [2024-11-16 13:52:01,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:52:01,313 INFO L225 Difference]: With dead ends: 407 [2024-11-16 13:52:01,313 INFO L226 Difference]: Without dead ends: 213 [2024-11-16 13:52:01,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-16 13:52:01,317 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 77 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:52:01,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 242 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-16 13:52:01,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-16 13:52:01,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2024-11-16 13:52:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 142 states have (on average 1.3309859154929577) internal successors, (189), 142 states have internal predecessors, (189), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-16 13:52:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 305 transitions. [2024-11-16 13:52:01,352 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 305 transitions. Word has length 193 [2024-11-16 13:52:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:52:01,354 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 305 transitions. [2024-11-16 13:52:01,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-16 13:52:01,355 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 305 transitions. [2024-11-16 13:52:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-16 13:52:01,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:52:01,359 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:52:01,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 13:52:01,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:52:01,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:52:01,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:52:01,560 INFO L85 PathProgramCache]: Analyzing trace with hash -398127522, now seen corresponding path program 1 times [2024-11-16 13:52:01,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:52:01,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688006083] [2024-11-16 13:52:01,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:52:01,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:52:01,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:52:01,565 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:52:01,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 13:52:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:52:03,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 13:52:03,084 INFO L278 TraceCheckSpWp]: Computing forward predicates...