./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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-ps-ci_file-97.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 c2b5d83791f5c517cc904865b76453ec006da14f7434583f731bc2f7adcccacf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:06:03,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:06:03,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:06:03,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:06:03,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:06:03,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:06:03,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:06:03,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:06:03,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:06:03,857 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:06:03,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:06:03,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:06:03,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:06:03,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:06:03,861 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:06:03,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:06:03,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:06:03,862 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:06:03,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:06:03,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:06:03,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:06:03,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:06:03,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:06:03,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:06:03,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:06:03,868 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:06:03,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:06:03,868 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:06:03,869 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:06:03,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:06:03,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:06:03,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:06:03,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:06:03,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:06:03,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:06:03,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:06:03,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:06:03,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:06:03,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:06:03,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:06:03,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:06:03,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:06:03,875 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 -> c2b5d83791f5c517cc904865b76453ec006da14f7434583f731bc2f7adcccacf [2024-11-10 06:06:04,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:06:04,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:06:04,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:06:04,204 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:06:04,204 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:06:04,206 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-ps-ci_file-97.i [2024-11-10 06:06:05,787 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:06:06,034 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:06:06,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i [2024-11-10 06:06:06,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f2f9b61f/b8aa18c21afa4ae6993c5e9a46e3dfab/FLAGc58c94f58 [2024-11-10 06:06:06,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f2f9b61f/b8aa18c21afa4ae6993c5e9a46e3dfab [2024-11-10 06:06:06,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:06:06,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:06:06,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:06:06,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:06:06,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:06:06,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:06:06" (1/1) ... [2024-11-10 06:06:06,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@276a4367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:06, skipping insertion in model container [2024-11-10 06:06:06,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:06:06" (1/1) ... [2024-11-10 06:06:06,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:06:06,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i[919,932] [2024-11-10 06:06:06,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:06:06,475 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:06:06,486 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i[919,932] [2024-11-10 06:06:06,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:06:06,578 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:06:06,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:06 WrapperNode [2024-11-10 06:06:06,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:06:06,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:06:06,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:06:06,581 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:06:06,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:06" (1/1) ... [2024-11-10 06:06:06,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:06" (1/1) ... [2024-11-10 06:06:06,662 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 251 [2024-11-10 06:06:06,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:06:06,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:06:06,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:06:06,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:06:06,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:06" (1/1) ... [2024-11-10 06:06:06,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:06" (1/1) ... [2024-11-10 06:06:06,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:06" (1/1) ... [2024-11-10 06:06:06,738 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-10 06:06:06,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:06" (1/1) ... [2024-11-10 06:06:06,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:06" (1/1) ... [2024-11-10 06:06:06,767 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:06" (1/1) ... [2024-11-10 06:06:06,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:06" (1/1) ... [2024-11-10 06:06:06,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:06" (1/1) ... [2024-11-10 06:06:06,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:06" (1/1) ... [2024-11-10 06:06:06,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:06:06,805 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:06:06,806 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:06:06,806 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:06:06,808 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:06" (1/1) ... [2024-11-10 06:06:06,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:06:06,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:06:06,849 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-10 06:06:06,854 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-10 06:06:06,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:06:06,913 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:06:06,913 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:06:06,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:06:06,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:06:06,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:06:07,027 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:06:07,030 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:06:07,711 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L174: havoc property_#t~ite22#1;havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short23#1;havoc property_#t~ite25#1;havoc property_#t~bitwise24#1;havoc property_#t~short26#1; [2024-11-10 06:06:07,757 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-10 06:06:07,757 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:06:07,795 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:06:07,795 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:06:07,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:06:07 BoogieIcfgContainer [2024-11-10 06:06:07,796 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:06:07,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:06:07,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:06:07,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:06:07,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:06:06" (1/3) ... [2024-11-10 06:06:07,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1cb36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:06:07, skipping insertion in model container [2024-11-10 06:06:07,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:06" (2/3) ... [2024-11-10 06:06:07,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1cb36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:06:07, skipping insertion in model container [2024-11-10 06:06:07,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:06:07" (3/3) ... [2024-11-10 06:06:07,806 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i [2024-11-10 06:06:07,825 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:06:07,825 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:06:07,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:06:07,907 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;@3a96262f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:06:07,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:06:07,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 86 states have (on average 1.5) internal successors, (129), 87 states have internal predecessors, (129), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:06:07,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-10 06:06:07,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:07,935 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:06:07,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:07,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:07,944 INFO L85 PathProgramCache]: Analyzing trace with hash 844978813, now seen corresponding path program 1 times [2024-11-10 06:06:07,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:07,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126422276] [2024-11-10 06:06:07,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:07,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:06:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:06:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:06:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:06:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:06:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:06:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:06:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:06:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:06:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:06:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:06:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 06:06:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:06:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:06:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:06:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:06:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:06:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:06:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:06:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:06:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 06:06:08,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:06:08,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126422276] [2024-11-10 06:06:08,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126422276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:08,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:08,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:06:08,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077901609] [2024-11-10 06:06:08,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:08,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:06:08,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:06:08,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:06:08,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:06:08,585 INFO L87 Difference]: Start difference. First operand has 109 states, 86 states have (on average 1.5) internal successors, (129), 87 states have internal predecessors, (129), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:06:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:08,641 INFO L93 Difference]: Finished difference Result 210 states and 351 transitions. [2024-11-10 06:06:08,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:06:08,649 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 142 [2024-11-10 06:06:08,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:08,660 INFO L225 Difference]: With dead ends: 210 [2024-11-10 06:06:08,660 INFO L226 Difference]: Without dead ends: 104 [2024-11-10 06:06:08,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-10 06:06:08,678 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:08,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:06:08,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-10 06:06:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-10 06:06:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 82 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:06:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 158 transitions. [2024-11-10 06:06:08,749 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 158 transitions. Word has length 142 [2024-11-10 06:06:08,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:08,752 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 158 transitions. [2024-11-10 06:06:08,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:06:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 158 transitions. [2024-11-10 06:06:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-10 06:06:08,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:08,761 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:06:08,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:06:08,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:08,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:08,764 INFO L85 PathProgramCache]: Analyzing trace with hash 50014841, now seen corresponding path program 1 times [2024-11-10 06:06:08,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:08,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468448093] [2024-11-10 06:06:08,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:08,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:06:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:06:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:06:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:06:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:06:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:06:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:06:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:06:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:06:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:06:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:06:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 06:06:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:06:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:06:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:06:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:06:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:06:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:06:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:06:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:06:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 06:06:09,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:06:09,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468448093] [2024-11-10 06:06:09,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468448093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:09,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:09,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:06:09,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405174126] [2024-11-10 06:06:09,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:09,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:06:09,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:06:09,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:06:09,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:06:09,220 INFO L87 Difference]: Start difference. First operand 104 states and 158 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:09,370 INFO L93 Difference]: Finished difference Result 292 states and 445 transitions. [2024-11-10 06:06:09,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:06:09,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2024-11-10 06:06:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:09,376 INFO L225 Difference]: With dead ends: 292 [2024-11-10 06:06:09,376 INFO L226 Difference]: Without dead ends: 191 [2024-11-10 06:06:09,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-10 06:06:09,381 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 141 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:09,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 356 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:06:09,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-10 06:06:09,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 173. [2024-11-10 06:06:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 130 states have (on average 1.3615384615384616) internal successors, (177), 130 states have internal predecessors, (177), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 06:06:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 257 transitions. [2024-11-10 06:06:09,434 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 257 transitions. Word has length 142 [2024-11-10 06:06:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:09,439 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 257 transitions. [2024-11-10 06:06:09,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 257 transitions. [2024-11-10 06:06:09,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-10 06:06:09,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:09,443 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:06:09,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:06:09,447 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:09,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash -460519336, now seen corresponding path program 1 times [2024-11-10 06:06:09,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:09,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182227205] [2024-11-10 06:06:09,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:09,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:06:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:06:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:06:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:06:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:06:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:06:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:06:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:06:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:06:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:06:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:06:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 06:06:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:06:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:06:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:06:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:06:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:06:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:06:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:06:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:06:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,160 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 06:06:10,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:06:10,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182227205] [2024-11-10 06:06:10,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182227205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:10,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:10,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:06:10,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124275176] [2024-11-10 06:06:10,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:10,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:06:10,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:06:10,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:06:10,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:06:10,164 INFO L87 Difference]: Start difference. First operand 173 states and 257 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:10,259 INFO L93 Difference]: Finished difference Result 401 states and 601 transitions. [2024-11-10 06:06:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:06:10,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2024-11-10 06:06:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:10,269 INFO L225 Difference]: With dead ends: 401 [2024-11-10 06:06:10,269 INFO L226 Difference]: Without dead ends: 231 [2024-11-10 06:06:10,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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-10 06:06:10,273 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 51 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:10,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 282 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:06:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-10 06:06:10,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 216. [2024-11-10 06:06:10,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 152 states have (on average 1.3223684210526316) internal successors, (201), 152 states have internal predecessors, (201), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 06:06:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 321 transitions. [2024-11-10 06:06:10,322 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 321 transitions. Word has length 142 [2024-11-10 06:06:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:10,325 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 321 transitions. [2024-11-10 06:06:10,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 321 transitions. [2024-11-10 06:06:10,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-10 06:06:10,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:10,327 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:06:10,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:06:10,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:10,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:10,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1796391671, now seen corresponding path program 1 times [2024-11-10 06:06:10,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:10,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519846131] [2024-11-10 06:06:10,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:10,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:06:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:06:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:06:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:06:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:06:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:06:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:06:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:06:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:06:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:06:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:06:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 06:06:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:06:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:06:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:06:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:06:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:06:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:06:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:06:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:06:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 06:06:10,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:06:10,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519846131] [2024-11-10 06:06:10,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519846131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:10,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:10,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:06:10,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103804702] [2024-11-10 06:06:10,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:10,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:06:10,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:06:10,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:06:10,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:06:10,807 INFO L87 Difference]: Start difference. First operand 216 states and 321 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:11,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:11,235 INFO L93 Difference]: Finished difference Result 565 states and 846 transitions. [2024-11-10 06:06:11,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:06:11,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2024-11-10 06:06:11,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:11,245 INFO L225 Difference]: With dead ends: 565 [2024-11-10 06:06:11,246 INFO L226 Difference]: Without dead ends: 395 [2024-11-10 06:06:11,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:06:11,252 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 204 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:11,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 654 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:06:11,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-10 06:06:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 377. [2024-11-10 06:06:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 271 states have (on average 1.3321033210332103) internal successors, (361), 271 states have internal predecessors, (361), 100 states have call successors, (100), 5 states have call predecessors, (100), 5 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-10 06:06:11,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 561 transitions. [2024-11-10 06:06:11,315 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 561 transitions. Word has length 142 [2024-11-10 06:06:11,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:11,317 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 561 transitions. [2024-11-10 06:06:11,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:11,318 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 561 transitions. [2024-11-10 06:06:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 06:06:11,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:11,320 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:06:11,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 06:06:11,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:11,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:11,321 INFO L85 PathProgramCache]: Analyzing trace with hash -538899807, now seen corresponding path program 1 times [2024-11-10 06:06:11,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:11,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208815389] [2024-11-10 06:06:11,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:11,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:06:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:06:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:06:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:06:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:06:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:06:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:06:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:06:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:06:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:06:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:06:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 06:06:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:06:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:06:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:06:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:06:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:06:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:06:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:06:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:06:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 06:06:11,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:06:11,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208815389] [2024-11-10 06:06:11,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208815389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:11,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:11,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 06:06:11,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110898017] [2024-11-10 06:06:11,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:11,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 06:06:11,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:06:11,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 06:06:11,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:06:11,977 INFO L87 Difference]: Start difference. First operand 377 states and 561 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:12,532 INFO L93 Difference]: Finished difference Result 913 states and 1349 transitions. [2024-11-10 06:06:12,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:06:12,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-10 06:06:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:12,539 INFO L225 Difference]: With dead ends: 913 [2024-11-10 06:06:12,539 INFO L226 Difference]: Without dead ends: 582 [2024-11-10 06:06:12,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 06:06:12,542 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 271 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:12,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 654 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 06:06:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-10 06:06:12,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 544. [2024-11-10 06:06:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 396 states have (on average 1.3257575757575757) internal successors, (525), 396 states have internal predecessors, (525), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-10 06:06:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 805 transitions. [2024-11-10 06:06:12,622 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 805 transitions. Word has length 143 [2024-11-10 06:06:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:12,623 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 805 transitions. [2024-11-10 06:06:12,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:12,624 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 805 transitions. [2024-11-10 06:06:12,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 06:06:12,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:12,626 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:06:12,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 06:06:12,626 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:12,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:12,627 INFO L85 PathProgramCache]: Analyzing trace with hash -837426119, now seen corresponding path program 1 times [2024-11-10 06:06:12,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:12,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785410360] [2024-11-10 06:06:12,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:12,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:06:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:06:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:06:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:06:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:06:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:06:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:06:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:06:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:06:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:06:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:06:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 06:06:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:06:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:06:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:06:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:06:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:06:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:06:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:06:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:06:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 06:06:12,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:06:12,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785410360] [2024-11-10 06:06:12,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785410360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:12,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:12,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:06:12,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957281387] [2024-11-10 06:06:12,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:12,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:06:12,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:06:12,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:06:12,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:06:12,985 INFO L87 Difference]: Start difference. First operand 544 states and 805 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:13,475 INFO L93 Difference]: Finished difference Result 830 states and 1232 transitions. [2024-11-10 06:06:13,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 06:06:13,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-10 06:06:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:13,482 INFO L225 Difference]: With dead ends: 830 [2024-11-10 06:06:13,482 INFO L226 Difference]: Without dead ends: 660 [2024-11-10 06:06:13,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:06:13,484 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 270 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:13,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 876 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 06:06:13,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-11-10 06:06:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 550. [2024-11-10 06:06:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 402 states have (on average 1.328358208955224) internal successors, (534), 402 states have internal predecessors, (534), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-10 06:06:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 814 transitions. [2024-11-10 06:06:13,560 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 814 transitions. Word has length 144 [2024-11-10 06:06:13,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:13,560 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 814 transitions. [2024-11-10 06:06:13,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 814 transitions. [2024-11-10 06:06:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 06:06:13,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:13,563 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:06:13,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 06:06:13,563 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:13,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:13,564 INFO L85 PathProgramCache]: Analyzing trace with hash 15993071, now seen corresponding path program 1 times [2024-11-10 06:06:13,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:13,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010457233] [2024-11-10 06:06:13,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:13,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:06:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:06:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:06:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:06:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:06:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:06:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:06:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:06:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:06:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:06:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:06:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 06:06:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:06:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:06:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:06:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:06:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:06:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:06:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:06:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:06:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 06:06:14,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:06:14,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010457233] [2024-11-10 06:06:14,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010457233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:14,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:14,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 06:06:14,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233481789] [2024-11-10 06:06:14,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:14,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 06:06:14,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:06:14,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 06:06:14,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:06:14,254 INFO L87 Difference]: Start difference. First operand 550 states and 814 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:14,625 INFO L93 Difference]: Finished difference Result 1069 states and 1586 transitions. [2024-11-10 06:06:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:06:14,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-10 06:06:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:14,631 INFO L225 Difference]: With dead ends: 1069 [2024-11-10 06:06:14,631 INFO L226 Difference]: Without dead ends: 565 [2024-11-10 06:06:14,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:06:14,634 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 131 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:14,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1155 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:06:14,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-10 06:06:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 550. [2024-11-10 06:06:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 402 states have (on average 1.308457711442786) internal successors, (526), 402 states have internal predecessors, (526), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-10 06:06:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 806 transitions. [2024-11-10 06:06:14,741 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 806 transitions. Word has length 144 [2024-11-10 06:06:14,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:14,741 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 806 transitions. [2024-11-10 06:06:14,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 806 transitions. [2024-11-10 06:06:14,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 06:06:14,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:14,744 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:06:14,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 06:06:14,744 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:14,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:14,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1154676957, now seen corresponding path program 1 times [2024-11-10 06:06:14,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:14,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914389312] [2024-11-10 06:06:14,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:14,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:06:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:06:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:06:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:06:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:06:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:06:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:06:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:06:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:06:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:06:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:06:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 06:06:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:06:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:14,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:06:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:15,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:06:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:15,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:06:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:15,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:06:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:15,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:06:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:15,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:06:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:15,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:06:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 06:06:15,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:06:15,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914389312] [2024-11-10 06:06:15,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914389312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:15,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:15,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:06:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221768464] [2024-11-10 06:06:15,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:15,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:06:15,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:06:15,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:06:15,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:06:15,015 INFO L87 Difference]: Start difference. First operand 550 states and 806 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:15,244 INFO L93 Difference]: Finished difference Result 1159 states and 1716 transitions. [2024-11-10 06:06:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:06:15,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2024-11-10 06:06:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:15,250 INFO L225 Difference]: With dead ends: 1159 [2024-11-10 06:06:15,250 INFO L226 Difference]: Without dead ends: 655 [2024-11-10 06:06:15,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:06:15,253 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 304 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:15,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 454 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:06:15,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-11-10 06:06:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 609. [2024-11-10 06:06:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 457 states have (on average 1.2975929978118161) internal successors, (593), 461 states have internal predecessors, (593), 142 states have call successors, (142), 9 states have call predecessors, (142), 9 states have return successors, (142), 138 states have call predecessors, (142), 142 states have call successors, (142) [2024-11-10 06:06:15,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 877 transitions. [2024-11-10 06:06:15,351 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 877 transitions. Word has length 148 [2024-11-10 06:06:15,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:15,352 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 877 transitions. [2024-11-10 06:06:15,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 877 transitions. [2024-11-10 06:06:15,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 06:06:15,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:15,354 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:06:15,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 06:06:15,355 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:15,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:15,355 INFO L85 PathProgramCache]: Analyzing trace with hash -507589292, now seen corresponding path program 1 times [2024-11-10 06:06:15,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:15,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172584750] [2024-11-10 06:06:15,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:15,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:06:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:06:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:06:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:06:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:06:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:06:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:06:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:06:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:06:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:06:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:06:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 06:06:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:06:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:06:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:06:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:06:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:06:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:06:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:06:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:06:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 06:06:22,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:06:22,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172584750] [2024-11-10 06:06:22,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172584750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:22,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:22,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 06:06:22,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023604848] [2024-11-10 06:06:22,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:22,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 06:06:22,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:06:22,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 06:06:22,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-10 06:06:22,470 INFO L87 Difference]: Start difference. First operand 609 states and 877 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:24,923 INFO L93 Difference]: Finished difference Result 1427 states and 1965 transitions. [2024-11-10 06:06:24,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 06:06:24,924 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2024-11-10 06:06:24,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:24,932 INFO L225 Difference]: With dead ends: 1427 [2024-11-10 06:06:24,933 INFO L226 Difference]: Without dead ends: 1026 [2024-11-10 06:06:24,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-10 06:06:24,937 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 176 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:24,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 947 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 06:06:24,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2024-11-10 06:06:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 930. [2024-11-10 06:06:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 757 states have (on average 1.2694848084544255) internal successors, (961), 768 states have internal predecessors, (961), 156 states have call successors, (156), 16 states have call predecessors, (156), 16 states have return successors, (156), 145 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-10 06:06:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1273 transitions. [2024-11-10 06:06:25,090 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1273 transitions. Word has length 148 [2024-11-10 06:06:25,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:25,095 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1273 transitions. [2024-11-10 06:06:25,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:25,095 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1273 transitions. [2024-11-10 06:06:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 06:06:25,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:25,098 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:06:25,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 06:06:25,099 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:25,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:25,099 INFO L85 PathProgramCache]: Analyzing trace with hash -574596045, now seen corresponding path program 1 times [2024-11-10 06:06:25,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:25,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661371314] [2024-11-10 06:06:25,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:25,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:06:25,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1357107120] [2024-11-10 06:06:25,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:25,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:06:25,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:06:25,190 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-10 06:06:25,192 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-10 06:06:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:06:25,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:06:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:06:25,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:06:25,627 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:06:25,628 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:06:25,646 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-10 06:06:25,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 06:06:25,838 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:06:25,966 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:06:25,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:06:25 BoogieIcfgContainer [2024-11-10 06:06:25,971 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:06:25,971 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:06:25,971 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:06:25,972 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:06:25,972 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:06:07" (3/4) ... [2024-11-10 06:06:25,975 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:06:25,976 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:06:25,976 INFO L158 Benchmark]: Toolchain (without parser) took 19898.09ms. Allocated memory was 163.6MB in the beginning and 459.3MB in the end (delta: 295.7MB). Free memory was 108.6MB in the beginning and 271.7MB in the end (delta: -163.1MB). Peak memory consumption was 133.0MB. Max. memory is 16.1GB. [2024-11-10 06:06:25,977 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 163.6MB. Free memory was 123.6MB in the beginning and 123.4MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:06:25,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.59ms. Allocated memory is still 163.6MB. Free memory was 108.1MB in the beginning and 89.7MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 06:06:25,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.95ms. Allocated memory is still 163.6MB. Free memory was 89.7MB in the beginning and 83.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 06:06:25,977 INFO L158 Benchmark]: Boogie Preprocessor took 141.07ms. Allocated memory is still 163.6MB. Free memory was 83.4MB in the beginning and 75.5MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 06:06:25,978 INFO L158 Benchmark]: IcfgBuilder took 990.78ms. Allocated memory was 163.6MB in the beginning and 245.4MB in the end (delta: 81.8MB). Free memory was 75.5MB in the beginning and 188.3MB in the end (delta: -112.8MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2024-11-10 06:06:25,978 INFO L158 Benchmark]: TraceAbstraction took 18171.79ms. Allocated memory was 245.4MB in the beginning and 459.3MB in the end (delta: 213.9MB). Free memory was 187.2MB in the beginning and 271.7MB in the end (delta: -84.5MB). Peak memory consumption was 128.4MB. Max. memory is 16.1GB. [2024-11-10 06:06:25,978 INFO L158 Benchmark]: Witness Printer took 4.59ms. Allocated memory is still 459.3MB. Free memory is still 271.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:06:25,980 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.22ms. Allocated memory is still 163.6MB. Free memory was 123.6MB in the beginning and 123.4MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.59ms. Allocated memory is still 163.6MB. Free memory was 108.1MB in the beginning and 89.7MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.95ms. Allocated memory is still 163.6MB. Free memory was 89.7MB in the beginning and 83.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 141.07ms. Allocated memory is still 163.6MB. Free memory was 83.4MB in the beginning and 75.5MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 990.78ms. Allocated memory was 163.6MB in the beginning and 245.4MB in the end (delta: 81.8MB). Free memory was 75.5MB in the beginning and 188.3MB in the end (delta: -112.8MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18171.79ms. Allocated memory was 245.4MB in the beginning and 459.3MB in the end (delta: 213.9MB). Free memory was 187.2MB in the beginning and 271.7MB in the end (delta: -84.5MB). Peak memory consumption was 128.4MB. Max. memory is 16.1GB. * Witness Printer took 4.59ms. Allocated memory is still 459.3MB. Free memory is still 271.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 someBinaryFLOATComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] unsigned short int var_1_29 = 8; [L41] unsigned short int var_1_33 = 48416; [L42] unsigned char var_1_35 = 4; [L43] unsigned long int var_1_37 = 32; [L44] unsigned char var_1_38 = 8; [L45] double var_1_40 = 31.75; [L46] double var_1_41 = 5.5; [L47] signed char var_1_43 = 100; [L48] signed long int last_1_var_1_5 = 5; VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0, var_1_9=643/5] [L178] isInitial = 1 [L179] FCALL initially() [L180] COND TRUE 1 [L181] CALL updateLastVariables() [L171] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0, var_1_9=643/5] [L181] RET updateLastVariables() [L182] CALL updateVariables() [L137] var_1_9 = __VERIFIER_nondet_float() [L138] 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_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L138] 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_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L139] var_1_10 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L140] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L141] var_1_11 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L142] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L143] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L143] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L144] var_1_12 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L145] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L146] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L146] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L147] var_1_13 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L148] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L149] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L149] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L150] var_1_14 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L151] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L152] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L152] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L153] var_1_18 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L154] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L155] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L155] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L156] var_1_19 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L157] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L158] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L159] var_1_23 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L160] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L161] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L161] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L162] var_1_33 = __VERIFIER_nondet_ushort() [L163] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L163] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L164] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L164] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L165] var_1_40 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L166] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L167] var_1_41 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L168] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L182] RET updateVariables() [L183] CALL step() [L52] COND FALSE !(\read(var_1_23)) [L57] var_1_24 = ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L59] COND TRUE (var_1_20 / var_1_12) < var_1_11 [L60] var_1_29 = var_1_12 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L64] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L67] COND TRUE ((((var_1_8) < (var_1_12)) ? (var_1_8) : (var_1_12))) >= var_1_20 [L68] var_1_37 = var_1_8 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L70] COND FALSE !((var_1_9 * (var_1_40 - var_1_41)) >= var_1_9) [L77] var_1_38 = var_1_14 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=100, var_1_5=5, var_1_8=0] [L79] COND FALSE !(((((var_1_10) > (64.75f)) ? (var_1_10) : (64.75f))) <= var_1_40) [L86] var_1_43 = var_1_13 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=5, var_1_8=0] [L88] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=5, var_1_8=0] [L91] var_1_20 = var_1_8 [L92] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=5, var_1_8=0] [L93] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=5, var_1_8=0] [L96] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=5, var_1_8=0] [L97] COND FALSE !(\read(var_1_22)) [L104] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=5, var_1_8=0] [L106] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L107] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=5, var_1_8=0] [L108] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=5, var_1_8=0] [L109] COND FALSE !(\read(var_1_22)) [L116] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=5, var_1_8=0] [L121] signed long int stepLocal_4 = 256; [L122] unsigned char stepLocal_3 = var_1_22; [L123] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=5, var_1_8=0] [L124] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=5, var_1_8=0] [L127] COND FALSE !(stepLocal_3 || var_1_22) [L132] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=-10000, var_1_8=0] [L183] RET step() [L184] CALL, EXPR property() [L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=-10000, var_1_8=0] [L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=-10000, var_1_8=0] [L174] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=-10000, var_1_8=0] [L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=-10000, var_1_8=0] [L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=-10000, var_1_8=0] [L174] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=-10000, var_1_8=0] [L174-L175] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L184] RET, EXPR property() [L184] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=-192, var_1_13=315, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=64, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=59, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.0s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1548 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1548 mSDsluCounter, 5530 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3735 mSDsCounter, 251 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1526 IncrementalHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 251 mSolverCounterUnsat, 1795 mSDtfsCounter, 1526 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=930occurred in iteration=9, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 356 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 1591 NumberOfCodeBlocks, 1591 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1286 ConstructedInterpolants, 0 QuantifiedInterpolants, 10536 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 6840/6840 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-10 06:06:26,058 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-ps-ci_file-97.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 c2b5d83791f5c517cc904865b76453ec006da14f7434583f731bc2f7adcccacf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:06:28,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:06:28,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:06:28,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:06:28,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:06:28,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:06:28,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:06:28,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:06:28,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:06:28,569 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:06:28,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:06:28,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:06:28,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:06:28,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:06:28,576 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:06:28,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:06:28,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:06:28,577 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:06:28,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:06:28,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:06:28,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:06:28,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:06:28,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:06:28,581 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:06:28,581 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:06:28,581 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:06:28,582 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:06:28,582 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:06:28,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:06:28,582 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:06:28,583 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:06:28,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:06:28,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:06:28,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:06:28,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:06:28,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:06:28,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:06:28,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:06:28,586 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:06:28,587 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:06:28,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:06:28,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:06:28,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:06:28,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:06:28,588 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 -> c2b5d83791f5c517cc904865b76453ec006da14f7434583f731bc2f7adcccacf [2024-11-10 06:06:28,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:06:28,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:06:28,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:06:28,966 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:06:28,966 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:06:28,968 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-ps-ci_file-97.i [2024-11-10 06:06:30,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:06:31,082 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:06:31,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i [2024-11-10 06:06:31,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c7fe981/b07561a7cf924497a81f05d51b68cd3e/FLAG53243097c [2024-11-10 06:06:31,126 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c7fe981/b07561a7cf924497a81f05d51b68cd3e [2024-11-10 06:06:31,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:06:31,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:06:31,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:06:31,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:06:31,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:06:31,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:06:31" (1/1) ... [2024-11-10 06:06:31,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42770b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:31, skipping insertion in model container [2024-11-10 06:06:31,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:06:31" (1/1) ... [2024-11-10 06:06:31,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:06:31,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i[919,932] [2024-11-10 06:06:31,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:06:31,517 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:06:31,537 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i[919,932] [2024-11-10 06:06:31,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:06:31,617 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:06:31,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:31 WrapperNode [2024-11-10 06:06:31,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:06:31,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:06:31,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:06:31,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:06:31,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:31" (1/1) ... [2024-11-10 06:06:31,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:31" (1/1) ... [2024-11-10 06:06:31,692 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-11-10 06:06:31,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:06:31,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:06:31,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:06:31,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:06:31,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:31" (1/1) ... [2024-11-10 06:06:31,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:31" (1/1) ... [2024-11-10 06:06:31,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:31" (1/1) ... [2024-11-10 06:06:31,741 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-10 06:06:31,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:31" (1/1) ... [2024-11-10 06:06:31,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:31" (1/1) ... [2024-11-10 06:06:31,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:31" (1/1) ... [2024-11-10 06:06:31,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:31" (1/1) ... [2024-11-10 06:06:31,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:31" (1/1) ... [2024-11-10 06:06:31,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:31" (1/1) ... [2024-11-10 06:06:31,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:06:31,777 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:06:31,777 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:06:31,777 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:06:31,778 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:31" (1/1) ... [2024-11-10 06:06:31,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:06:31,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:06:31,853 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-10 06:06:31,859 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-10 06:06:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:06:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:06:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:06:31,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:06:31,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:06:31,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:06:32,020 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:06:32,023 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:06:38,951 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 06:06:38,951 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:06:38,971 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:06:38,971 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:06:38,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:06:38 BoogieIcfgContainer [2024-11-10 06:06:38,972 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:06:38,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:06:38,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:06:38,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:06:38,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:06:31" (1/3) ... [2024-11-10 06:06:38,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5599632e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:06:38, skipping insertion in model container [2024-11-10 06:06:38,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:31" (2/3) ... [2024-11-10 06:06:38,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5599632e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:06:38, skipping insertion in model container [2024-11-10 06:06:38,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:06:38" (3/3) ... [2024-11-10 06:06:38,981 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i [2024-11-10 06:06:38,999 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:06:38,999 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:06:39,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:06:39,074 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;@b0840bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:06:39,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:06:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:06:39,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-10 06:06:39,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:39,096 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:06:39,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:39,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:39,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1388456542, now seen corresponding path program 1 times [2024-11-10 06:06:39,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:06:39,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584986368] [2024-11-10 06:06:39,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:39,117 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-10 06:06:39,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:06:39,121 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-10 06:06:39,122 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-10 06:06:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:39,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:06:39,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:06:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-11-10 06:06:39,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:06:39,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:06:39,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584986368] [2024-11-10 06:06:39,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584986368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:39,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:39,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:06:39,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649369904] [2024-11-10 06:06:39,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:39,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:06:39,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:06:39,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:06:39,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:06:39,745 INFO L87 Difference]: Start difference. First operand has 78 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:06:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:39,771 INFO L93 Difference]: Finished difference Result 147 states and 251 transitions. [2024-11-10 06:06:39,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:06:39,774 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 138 [2024-11-10 06:06:39,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:39,782 INFO L225 Difference]: With dead ends: 147 [2024-11-10 06:06:39,782 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 06:06:39,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 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-10 06:06:39,790 INFO L432 NwaCegarLoop]: 107 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, 107 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-10 06:06:39,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:06:39,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 06:06:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-10 06:06:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:06:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions. [2024-11-10 06:06:39,836 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 138 [2024-11-10 06:06:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:39,837 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 107 transitions. [2024-11-10 06:06:39,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:06:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions. [2024-11-10 06:06:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-10 06:06:39,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:39,842 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:06:39,856 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-10 06:06:40,043 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-10 06:06:40,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:40,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:40,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1910462554, now seen corresponding path program 1 times [2024-11-10 06:06:40,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:06:40,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090262924] [2024-11-10 06:06:40,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:40,046 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-10 06:06:40,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:06:40,048 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-10 06:06:40,049 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-10 06:06:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:40,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 06:06:40,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:06:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 06:06:42,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:06:42,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:06:42,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090262924] [2024-11-10 06:06:42,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090262924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:42,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:42,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:06:42,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108981588] [2024-11-10 06:06:42,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:42,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:06:42,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:06:42,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:06:42,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:06:42,213 INFO L87 Difference]: Start difference. First operand 72 states and 107 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:42,394 INFO L93 Difference]: Finished difference Result 207 states and 309 transitions. [2024-11-10 06:06:42,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:06:42,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-11-10 06:06:42,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:42,402 INFO L225 Difference]: With dead ends: 207 [2024-11-10 06:06:42,402 INFO L226 Difference]: Without dead ends: 138 [2024-11-10 06:06:42,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 136 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-10 06:06:42,408 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 33 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:42,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 193 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:06:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-10 06:06:42,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2024-11-10 06:06:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 85 states have internal predecessors, (109), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 06:06:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 189 transitions. [2024-11-10 06:06:42,455 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 189 transitions. Word has length 138 [2024-11-10 06:06:42,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:42,457 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 189 transitions. [2024-11-10 06:06:42,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 189 transitions. [2024-11-10 06:06:42,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-10 06:06:42,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:42,463 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:06:42,481 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-10 06:06:42,664 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-10 06:06:42,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:42,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:42,666 INFO L85 PathProgramCache]: Analyzing trace with hash 913390201, now seen corresponding path program 1 times [2024-11-10 06:06:42,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:06:42,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709220437] [2024-11-10 06:06:42,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:42,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:06:42,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:06:42,671 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-10 06:06:42,672 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-10 06:06:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:43,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 06:06:43,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:06:43,578 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 289 proven. 12 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-11-10 06:06:43,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:06:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 06:06:44,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:06:44,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709220437] [2024-11-10 06:06:44,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709220437] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:06:44,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 06:06:44,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-10 06:06:44,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906305794] [2024-11-10 06:06:44,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 06:06:44,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 06:06:44,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:06:44,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 06:06:44,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:06:44,576 INFO L87 Difference]: Start difference. First operand 128 states and 189 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 06:06:46,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:46,011 INFO L93 Difference]: Finished difference Result 202 states and 292 transitions. [2024-11-10 06:06:46,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 06:06:46,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 138 [2024-11-10 06:06:46,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:46,018 INFO L225 Difference]: With dead ends: 202 [2024-11-10 06:06:46,018 INFO L226 Difference]: Without dead ends: 77 [2024-11-10 06:06:46,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-10 06:06:46,021 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 106 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:46,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 155 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 06:06:46,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-10 06:06:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2024-11-10 06:06:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:06:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2024-11-10 06:06:46,034 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 138 [2024-11-10 06:06:46,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:46,035 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2024-11-10 06:06:46,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 06:06:46,035 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2024-11-10 06:06:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-10 06:06:46,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:46,037 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:06:46,057 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-10 06:06:46,238 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-10 06:06:46,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:46,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:46,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1042472920, now seen corresponding path program 1 times [2024-11-10 06:06:46,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:06:46,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607237631] [2024-11-10 06:06:46,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:46,241 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-10 06:06:46,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:06:46,246 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-10 06:06:46,247 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-10 06:06:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:46,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 06:06:46,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:06:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 06:06:48,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:06:48,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:06:48,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607237631] [2024-11-10 06:06:48,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607237631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:48,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:48,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:06:48,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53372435] [2024-11-10 06:06:48,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:48,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:06:48,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:06:48,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:06:48,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:06:48,391 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:49,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:49,503 INFO L93 Difference]: Finished difference Result 196 states and 273 transitions. [2024-11-10 06:06:49,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:06:49,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-11-10 06:06:49,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:49,507 INFO L225 Difference]: With dead ends: 196 [2024-11-10 06:06:49,507 INFO L226 Difference]: Without dead ends: 126 [2024-11-10 06:06:49,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 06:06:49,510 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 113 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:49,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 342 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 06:06:49,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-10 06:06:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 73. [2024-11-10 06:06:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:06:49,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2024-11-10 06:06:49,538 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 138 [2024-11-10 06:06:49,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:49,539 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2024-11-10 06:06:49,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:49,540 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2024-11-10 06:06:49,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 06:06:49,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:49,542 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:06:49,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-10 06:06:49,742 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-10 06:06:49,743 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:49,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:49,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1856477038, now seen corresponding path program 1 times [2024-11-10 06:06:49,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:06:49,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850250550] [2024-11-10 06:06:49,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:49,745 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-10 06:06:49,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:06:49,747 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-10 06:06:49,748 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-10 06:06:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 06:06:50,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:06:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 06:06:53,820 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:06:53,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:06:53,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850250550] [2024-11-10 06:06:53,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850250550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:53,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:53,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:06:53,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260197730] [2024-11-10 06:06:53,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:53,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:06:53,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:06:53,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:06:53,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:06:53,823 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:54,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:54,634 INFO L93 Difference]: Finished difference Result 222 states and 300 transitions. [2024-11-10 06:06:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:06:54,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-11-10 06:06:54,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:54,637 INFO L225 Difference]: With dead ends: 222 [2024-11-10 06:06:54,637 INFO L226 Difference]: Without dead ends: 152 [2024-11-10 06:06:54,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:06:54,639 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 72 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:54,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 313 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 06:06:54,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-10 06:06:54,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 140. [2024-11-10 06:06:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 95 states have (on average 1.1789473684210525) internal successors, (112), 95 states have internal predecessors, (112), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 06:06:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2024-11-10 06:06:54,683 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 139 [2024-11-10 06:06:54,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:54,684 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2024-11-10 06:06:54,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:06:54,684 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2024-11-10 06:06:54,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-10 06:06:54,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:54,686 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:06:54,706 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 (6)] Ended with exit code 0 [2024-11-10 06:06:54,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-10 06:06:54,888 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:54,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:54,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1457237994, now seen corresponding path program 1 times [2024-11-10 06:06:54,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:06:54,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446692396] [2024-11-10 06:06:54,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:54,889 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-10 06:06:54,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:06:54,893 INFO L229 MonitoredProcess]: Starting monitored process 7 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-10 06:06:54,894 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 (7)] Waiting until timeout for monitored process [2024-11-10 06:06:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:55,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-10 06:06:55,902 INFO L278 TraceCheckSpWp]: Computing forward predicates...